./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/strreplace-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/strreplace-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 4aab5dc49efb2008f48b80e5d09bedb13ca5cefa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:53:54,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:53:54,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:53:54,638 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:53:54,639 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:53:54,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:53:54,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:53:54,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:53:54,647 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:53:54,651 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:53:54,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:53:54,655 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:53:54,656 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:53:54,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:53:54,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:53:54,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:53:54,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:53:54,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:53:54,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:53:54,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:53:54,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:53:54,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:53:54,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:53:54,693 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:53:54,693 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:53:54,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:53:54,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:53:54,696 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:53:54,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:53:54,697 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:53:54,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:53:54,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:53:54,698 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:53:54,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:53:54,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:53:54,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:53:54,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:53:54,717 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:53:54,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:53:54,718 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:53:54,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:53:54,719 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:53:54,719 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:53:54,719 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:53:54,719 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:53:54,719 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:53:54,720 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:53:54,720 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:53:54,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:53:54,720 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:53:54,720 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:53:54,720 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:53:54,721 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:53:54,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:53:54,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:53:54,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:53:54,721 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:53:54,721 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:53:54,722 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:53:54,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:53:54,722 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:53:54,722 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:53:54,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:53:54,723 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:53:54,723 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:53:54,724 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:53:54,724 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 -> 4aab5dc49efb2008f48b80e5d09bedb13ca5cefa [2019-01-01 21:53:54,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:53:54,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:53:54,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:53:54,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:53:54,785 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:53:54,785 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/strreplace-alloca_true-termination.c.i [2019-01-01 21:53:54,847 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af249f778/06d7930be76045e5bfc81713b9d9b539/FLAG774f18b1f [2019-01-01 21:53:55,305 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:53:55,306 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/strreplace-alloca_true-termination.c.i [2019-01-01 21:53:55,323 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af249f778/06d7930be76045e5bfc81713b9d9b539/FLAG774f18b1f [2019-01-01 21:53:55,636 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af249f778/06d7930be76045e5bfc81713b9d9b539 [2019-01-01 21:53:55,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:53:55,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:53:55,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:53:55,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:53:55,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:53:55,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:53:55" (1/1) ... [2019-01-01 21:53:55,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e33331b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:55, skipping insertion in model container [2019-01-01 21:53:55,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:53:55" (1/1) ... [2019-01-01 21:53:55,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:53:55,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:53:56,108 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:53:56,120 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:53:56,185 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:53:56,260 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:53:56,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56 WrapperNode [2019-01-01 21:53:56,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:53:56,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:53:56,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:53:56,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:53:56,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... [2019-01-01 21:53:56,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... [2019-01-01 21:53:56,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:53:56,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:53:56,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:53:56,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:53:56,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... [2019-01-01 21:53:56,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... [2019-01-01 21:53:56,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... [2019-01-01 21:53:56,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... [2019-01-01 21:53:56,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... [2019-01-01 21:53:56,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... [2019-01-01 21:53:56,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... [2019-01-01 21:53:56,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:53:56,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:53:56,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:53:56,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:53:56,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:53:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:53:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:53:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:53:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:53:56,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:53:56,898 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:53:56,898 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:53:56,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:56 BoogieIcfgContainer [2019-01-01 21:53:56,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:53:56,903 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:53:56,903 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:53:56,915 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:53:56,916 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:56,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:53:55" (1/3) ... [2019-01-01 21:53:56,917 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a0d1697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:53:56, skipping insertion in model container [2019-01-01 21:53:56,917 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:56,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:56" (2/3) ... [2019-01-01 21:53:56,918 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a0d1697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:53:56, skipping insertion in model container [2019-01-01 21:53:56,918 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:56,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:56" (3/3) ... [2019-01-01 21:53:56,923 INFO L375 chiAutomizerObserver]: Analyzing ICFG strreplace-alloca_true-termination.c.i [2019-01-01 21:53:56,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:53:57,000 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:53:57,000 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:53:57,000 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:53:57,000 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:53:57,000 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:53:57,001 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:53:57,001 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:53:57,001 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:53:57,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:53:57,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:53:57,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:57,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:57,053 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:53:57,053 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:53:57,053 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:53:57,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:53:57,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:53:57,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:57,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:57,057 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:53:57,057 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:53:57,067 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~nondet9, main_#t~ret10, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 10#L562true assume !(main_~length1~0 < 1); 14#L562-2true call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet8 % 256 <= 127 then main_#t~nondet8 % 256 else main_#t~nondet8 % 256 - 256), (if main_#t~nondet9 % 256 <= 127 then main_#t~nondet9 % 256 else main_#t~nondet9 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; 3#L551-3true [2019-01-01 21:53:57,067 INFO L796 eck$LassoCheckResult]: Loop: 3#L551-3true call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 12#L551-1true assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 9#L552true assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; 13#L552-2true cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; 3#L551-3true [2019-01-01 21:53:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-01 21:53:57,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:57,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:57,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:57,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:57,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1359562, now seen corresponding path program 1 times [2019-01-01 21:53:57,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:57,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:57,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:57,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 176704686, now seen corresponding path program 1 times [2019-01-01 21:53:57,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:57,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:57,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:57,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:57,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:57,500 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 21:53:57,614 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 21:53:58,296 WARN L181 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-01-01 21:53:59,474 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 21:53:59,505 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:53:59,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:53:59,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:53:59,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:53:59,509 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:53:59,509 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:59,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:53:59,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:53:59,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:53:59,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:53:59,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:53:59,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:59,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:59,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:59,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:59,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:59,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:59,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:59,714 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-01 21:54:00,903 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-01 21:54:00,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:00,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:00,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:01,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:01,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:01,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:01,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:01,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:01,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:01,596 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-01 21:54:02,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:02,120 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:02,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:02,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:02,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:02,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:02,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:02,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:02,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:02,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:02,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:02,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:02,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:02,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:02,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:02,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:02,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:02,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:02,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:02,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:02,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:02,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:02,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:02,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:02,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:02,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:02,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:02,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:02,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:02,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:02,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:02,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:02,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:02,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:02,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:02,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:02,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:02,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:02,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:02,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:02,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:02,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:02,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:02,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:02,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:02,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:02,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:02,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:02,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:02,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:02,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:02,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:02,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:02,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:02,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:02,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-01 21:54:02,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:02,175 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:54:02,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:02,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:02,182 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:54:02,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:02,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:02,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:02,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:02,215 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:54:02,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:02,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:02,220 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:54:02,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:02,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:02,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:02,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:02,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:02,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:02,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:02,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:02,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:02,284 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:02,333 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:54:02,333 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:54:02,336 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:02,338 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:54:02,339 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:02,339 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1 - 1*ULTIMATE.start_cstrreplace_~p~0.offset Supporting invariants [] [2019-01-01 21:54:02,381 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:54:02,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:54:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:02,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:02,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:02,561 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:54:02,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-01-01 21:54:02,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 6 states. [2019-01-01 21:54:02,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:54:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:54:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-01 21:54:02,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:54:02,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:02,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:54:02,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:02,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-01 21:54:02,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:02,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-01-01 21:54:02,680 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:54:02,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-01-01 21:54:02,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:54:02,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:54:02,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:54:02,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:54:02,684 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:54:02,684 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:54:02,684 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:54:02,685 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:54:02,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:54:02,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:54:02,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:54:02,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:54:02 BoogieIcfgContainer [2019-01-01 21:54:02,692 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:54:02,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:54:02,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:54:02,693 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:54:02,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:56" (3/4) ... [2019-01-01 21:54:02,698 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:54:02,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:54:02,699 INFO L168 Benchmark]: Toolchain (without parser) took 7058.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -121.0 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:02,701 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-01 21:54:02,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:02,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:02,703 INFO L168 Benchmark]: Boogie Preprocessor took 55.40 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-01 21:54:02,704 INFO L168 Benchmark]: RCFGBuilder took 457.89 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.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:02,704 INFO L168 Benchmark]: BuchiAutomizer took 5789.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:02,705 INFO L168 Benchmark]: Witness Printer took 5.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-01 21:54:02,711 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 618.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.40 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 457.89 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.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5789.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.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. * 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 unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * p and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. 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: 8 SDtfs, 9 SDslu, 3 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital512 mio100 ax103 hnf98 lsp43 ukn168 mio100 lsp15 div141 bol100 ite100 ukn100 eq156 hnf70 smp81 dnf228 smp53 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...