./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer --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 32bit --witnessprinter.graph.data.programhash 50bdaf600d03af0a677a59daf6a875dbe69c10b2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:34,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:34,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:34,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:34,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:34,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:34,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:34,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:34,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:34,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:34,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:34,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:34,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:34,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:34,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:34,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:34,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:34,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:34,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:34,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:34,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:34,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:34,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:34,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:34,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:34,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:34,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:34,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:34,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:34,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:34,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:34,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:34,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:34,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:34,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:34,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:34,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:34,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:34,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:34,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:34,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:34,812 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:34,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:34,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:34,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:34,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:34,826 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:34,826 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:34,826 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:34,826 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:34,826 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:34,827 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:34,827 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:34,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:34,827 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:34,827 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:34,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:34,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:34,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:34,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:34,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:34,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:34,829 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:34,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:34,829 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:34,829 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:34,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:34,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:34,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:34,830 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:34,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:34,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:34,830 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:34,831 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:34,832 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50bdaf600d03af0a677a59daf6a875dbe69c10b2 [2019-10-22 09:02:34,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:34,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:34,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:34,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:34,870 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:34,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2019-10-22 09:02:34,913 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/data/dc2561e9f/f0b5db99dea640689cde1341f6e87d88/FLAG036a78f71 [2019-10-22 09:02:35,340 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:35,340 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2019-10-22 09:02:35,351 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/data/dc2561e9f/f0b5db99dea640689cde1341f6e87d88/FLAG036a78f71 [2019-10-22 09:02:35,362 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/data/dc2561e9f/f0b5db99dea640689cde1341f6e87d88 [2019-10-22 09:02:35,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:35,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:35,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:35,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:35,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:35,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cfff8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35, skipping insertion in model container [2019-10-22 09:02:35,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,379 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:35,410 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:35,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:35,762 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:35,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:35,852 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:35,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35 WrapperNode [2019-10-22 09:02:35,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:35,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:35,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:35,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:35,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:35,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:35,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:35,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:35,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:35,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:35,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:35,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:35,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffc7a6f6-2c76-44f5-87f3-1d6e18d14824/bin/uautomizer/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-10-22 09:02:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:36,169 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:36,169 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:02:36,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:36 BoogieIcfgContainer [2019-10-22 09:02:36,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:36,171 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:36,171 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:36,174 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:36,175 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:36,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:35" (1/3) ... [2019-10-22 09:02:36,176 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69df2eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:36, skipping insertion in model container [2019-10-22 09:02:36,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:36,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35" (2/3) ... [2019-10-22 09:02:36,177 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69df2eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:36, skipping insertion in model container [2019-10-22 09:02:36,177 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:36,177 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:36" (3/3) ... [2019-10-22 09:02:36,178 INFO L371 chiAutomizerObserver]: Analyzing ICFG strreplace-alloca-2.i [2019-10-22 09:02:36,253 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:36,254 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:36,254 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:36,254 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:36,254 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:36,254 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:36,254 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:36,254 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:36,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:02:36,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:36,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:36,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:36,338 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:02:36,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:36,338 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:36,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:02:36,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:36,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:36,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:36,341 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:02:36,341 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:36,355 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 17#L528true assume !(main_~length1~0 < 1); 5#L528-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;main_~i~0 := 0; 12#L533-3true [2019-10-22 09:02:36,355 INFO L793 eck$LassoCheckResult]: Loop: 12#L533-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; 11#L533-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 12#L533-3true [2019-10-22 09:02:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 09:02:36,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676985136] [2019-10-22 09:02:36,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,501 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 09:02:36,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553561311] [2019-10-22 09:02:36,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,518 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 09:02:36,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538635199] [2019-10-22 09:02:36,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,556 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:36,726 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:36,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:36,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:36,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:36,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:36,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:36,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:36,729 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:36,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration1_Lasso [2019-10-22 09:02:36,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:36,729 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:36,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:36,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:37,119 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:37,125 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:37,127 INFO L120 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-10-22 09:02:37,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,129 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:37,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,130 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:37,130 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:37,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,138 INFO L120 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-10-22 09:02:37,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:37,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:37,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:37,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,141 INFO L120 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-10-22 09:02:37,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:37,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,142 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:37,143 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:37,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,144 INFO L120 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-10-22 09:02:37,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:37,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,147 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:37,147 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:37,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,148 INFO L120 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-10-22 09:02:37,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,148 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:37,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,149 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:37,149 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:37,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,150 INFO L120 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-10-22 09:02:37,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,156 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:37,156 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,160 INFO L120 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-10-22 09:02:37,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,165 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:37,166 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,175 INFO L120 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-10-22 09:02:37,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,182 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:37,182 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,197 INFO L120 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-10-22 09:02:37,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,199 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:37,199 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,205 INFO L120 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-10-22 09:02:37,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,205 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:37,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,206 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:37,206 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:37,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,207 INFO L120 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-10-22 09:02:37,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,212 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:37,213 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,224 INFO L120 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-10-22 09:02:37,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,225 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,230 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:37,230 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,299 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:37,339 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:02:37,339 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:02:37,341 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:37,343 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:37,343 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:37,344 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 09:02:37,357 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:37,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:37,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:37,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:37,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:37,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:37,442 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-10-22 09:02:37,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-10-22 09:02:37,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 51 transitions. Complement of second has 7 states. [2019-10-22 09:02:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-10-22 09:02:37,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 09:02:37,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:37,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 09:02:37,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:37,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 09:02:37,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:37,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 51 transitions. [2019-10-22 09:02:37,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:37,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2019-10-22 09:02:37,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:02:37,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:37,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-10-22 09:02:37,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:37,519 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:02:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-10-22 09:02:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 09:02:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:02:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-10-22 09:02:37,546 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:02:37,546 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:02:37,546 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:37,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-10-22 09:02:37,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:37,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:37,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:37,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:02:37,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:37,547 INFO L791 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 116#L528 assume !(main_~length1~0 < 1); 117#L528-2 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;main_~i~0 := 0; 118#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 122#L533-4 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~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 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; 112#L517-3 [2019-10-22 09:02:37,548 INFO L793 eck$LassoCheckResult]: Loop: 112#L517-3 call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 113#L517-1 assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 114#L518 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; 111#L518-2 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; 112#L517-3 [2019-10-22 09:02:37,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,549 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 09:02:37,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673301500] [2019-10-22 09:02:37,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1790538, now seen corresponding path program 1 times [2019-10-22 09:02:37,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221965612] [2019-10-22 09:02:37,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,597 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1952978730, now seen corresponding path program 1 times [2019-10-22 09:02:37,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202754434] [2019-10-22 09:02:37,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:37,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202754434] [2019-10-22 09:02:37,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:37,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:02:37,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113178] [2019-10-22 09:02:37,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:37,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:02:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:37,820 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-10-22 09:02:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:37,893 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-10-22 09:02:37,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:37,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-10-22 09:02:37,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:37,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 16 transitions. [2019-10-22 09:02:37,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:37,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:37,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-10-22 09:02:37,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:37,896 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 09:02:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-10-22 09:02:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-10-22 09:02:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:02:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-10-22 09:02:37,898 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 09:02:37,898 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 09:02:37,898 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:37,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-10-22 09:02:37,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:37,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:37,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:37,900 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:37,900 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:37,900 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 155#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 156#L528 assume !(main_~length1~0 < 1); 161#L528-2 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;main_~i~0 := 0; 162#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; 164#L533-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 165#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 166#L533-4 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~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 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; 160#L517-3 [2019-10-22 09:02:37,900 INFO L793 eck$LassoCheckResult]: Loop: 160#L517-3 call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 157#L517-1 assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 158#L518 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; 159#L518-2 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; 160#L517-3 [2019-10-22 09:02:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 09:02:37,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481982040] [2019-10-22 09:02:37,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,927 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1790538, now seen corresponding path program 2 times [2019-10-22 09:02:37,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857021582] [2019-10-22 09:02:37,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,938 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash -357903304, now seen corresponding path program 1 times [2019-10-22 09:02:37,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19095362] [2019-10-22 09:02:37,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:38,000 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:38,314 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-10-22 09:02:38,683 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-22 09:02:38,688 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:38,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:38,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:38,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:38,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:38,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:38,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:38,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:38,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration3_Lasso [2019-10-22 09:02:38,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:38,690 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:38,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,779 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-22 09:02:39,318 WARN L191 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-10-22 09:02:39,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,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-10-22 09:02:39,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,970 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:39,971 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:39,971 INFO L120 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-10-22 09:02:39,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,977 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,979 INFO L120 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-10-22 09:02:39,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,980 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,981 INFO L120 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-10-22 09:02:39,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,982 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,982 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,982 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,983 INFO L120 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-10-22 09:02:39,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,995 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,996 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,998 INFO L120 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-10-22 09:02:39,998 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,001 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,004 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,007 INFO L120 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-10-22 09:02:40,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,007 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,012 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,014 INFO L120 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-10-22 09:02:40,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,014 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,015 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,015 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,016 INFO L120 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-10-22 09:02:40,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,021 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,021 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,023 INFO L120 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-10-22 09:02:40,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,034 INFO L120 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-10-22 09:02:40,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,035 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,035 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,041 INFO L120 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-10-22 09:02:40,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,043 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,044 INFO L120 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-10-22 09:02:40,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,047 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,047 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,049 INFO L120 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-10-22 09:02:40,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,103 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:40,155 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-10-22 09:02:40,160 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-10-22 09:02:40,161 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:40,162 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:40,162 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:40,162 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrreplace_~p~0.base)_1, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrreplace_~p~0.base)_1 - 1*ULTIMATE.start_cstrreplace_~p~0.offset Supporting invariants [] [2019-10-22 09:02:40,180 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:02:40,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:40,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:40,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:40,231 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-10-22 09:02:40,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 09:02:40,250 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 16 states and 21 transitions. Complement of second has 4 states. [2019-10-22 09:02:40,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 09:02:40,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2019-10-22 09:02:40,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:40,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2019-10-22 09:02:40,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:40,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2019-10-22 09:02:40,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:40,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-10-22 09:02:40,254 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:40,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-10-22 09:02:40,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:40,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:40,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:40,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:40,254 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:40,255 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:40,255 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:40,255 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:40,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:40,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:40,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:40,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:40 BoogieIcfgContainer [2019-10-22 09:02:40,265 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:40,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:40,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:40,265 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:40,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:36" (3/4) ... [2019-10-22 09:02:40,270 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:40,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:40,273 INFO L168 Benchmark]: Toolchain (without parser) took 4907.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.6 MB). Free memory was 937.0 MB in the beginning and 895.2 MB in the end (delta: 41.7 MB). Peak memory consumption was 302.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:40,275 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:40,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 486.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 937.0 MB in the beginning and 1.2 GB in the end (delta: -232.6 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:40,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:40,277 INFO L168 Benchmark]: Boogie Preprocessor took 31.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:40,278 INFO L168 Benchmark]: RCFGBuilder took 250.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:40,278 INFO L168 Benchmark]: BuchiAutomizer took 4094.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 895.2 MB in the end (delta: 243.5 MB). Peak memory consumption was 317.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:40,278 INFO L168 Benchmark]: Witness Printer took 6.88 ms. Allocated memory is still 1.3 GB. Free memory is still 895.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:40,282 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 486.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 937.0 MB in the beginning and 1.2 GB in the end (delta: -232.6 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 250.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4094.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 895.2 MB in the end (delta: 243.5 MB). Peak memory consumption was 317.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.88 ms. Allocated memory is still 1.3 GB. Free memory is still 895.2 MB. 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[p] + -1 * p and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.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 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 52 SDslu, 39 SDs, 0 SdLazy, 47 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital339 mio100 ax111 hnf98 lsp59 ukn130 mio100 lsp37 div114 bol100 ite100 ukn100 eq163 hnf84 smp97 dnf141 smp77 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...