./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncat-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/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/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 170d05f666fe960395aa4fb943b7fdfa4284d519 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 19:57:43,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:57:43,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:57:43,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:57:43,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:57:43,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:57:43,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:57:43,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:57:43,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:57:43,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:57:43,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:57:43,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:57:43,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:57:43,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:57:43,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:57:43,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:57:43,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:57:43,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:57:43,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:57:43,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:57:43,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:57:43,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:57:43,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:57:43,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:57:43,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:57:43,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:57:43,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:57:43,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:57:43,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:57:43,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:57:43,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:57:43,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:57:43,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:57:43,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:57:43,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:57:43,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:57:43,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:57:43,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:57:43,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:57:43,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:57:43,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:57:43,168 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 19:57:43,184 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:57:43,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:57:43,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:57:43,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:57:43,186 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:57:43,186 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 19:57:43,186 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 19:57:43,186 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 19:57:43,187 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 19:57:43,187 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 19:57:43,187 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 19:57:43,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:57:43,187 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:57:43,188 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:57:43,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:57:43,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:57:43,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:57:43,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 19:57:43,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 19:57:43,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 19:57:43,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:57:43,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:57:43,190 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 19:57:43,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:57:43,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 19:57:43,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:57:43,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:57:43,191 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 19:57:43,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:57:43,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:57:43,191 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 19:57:43,192 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 19:57:43,192 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/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/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 -> 170d05f666fe960395aa4fb943b7fdfa4284d519 [2019-11-15 19:57:43,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:57:43,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:57:43,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:57:43,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:57:43,232 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:57:43,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2019-11-15 19:57:43,289 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/data/294d53f4c/6c120933e5dc4d978dfb604d0e88514e/FLAG869c07068 [2019-11-15 19:57:43,770 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:57:43,775 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2019-11-15 19:57:43,791 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/data/294d53f4c/6c120933e5dc4d978dfb604d0e88514e/FLAG869c07068 [2019-11-15 19:57:44,252 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/bin/uautomizer/data/294d53f4c/6c120933e5dc4d978dfb604d0e88514e [2019-11-15 19:57:44,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:57:44,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:57:44,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:57:44,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:57:44,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:57:44,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b8b389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44, skipping insertion in model container [2019-11-15 19:57:44,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,271 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:57:44,306 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:57:44,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:57:44,687 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:57:44,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:57:44,785 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:57:44,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44 WrapperNode [2019-11-15 19:57:44,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:57:44,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:57:44,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:57:44,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:57:44,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:57:44,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:57:44,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:57:44,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:57:44,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:57:44,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:57:44,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:57:44,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:57:44,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6bc13e51-f495-4fda-9af4-561d3d5d9d6b/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-11-15 19:57:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 19:57:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 19:57:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 19:57:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:57:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:57:44,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:57:45,326 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:57:45,326 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 19:57:45,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:57:45 BoogieIcfgContainer [2019-11-15 19:57:45,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:57:45,328 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 19:57:45,328 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 19:57:45,331 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 19:57:45,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:57:45,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 07:57:44" (1/3) ... [2019-11-15 19:57:45,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49ba2bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:57:45, skipping insertion in model container [2019-11-15 19:57:45,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:57:45,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (2/3) ... [2019-11-15 19:57:45,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49ba2bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:57:45, skipping insertion in model container [2019-11-15 19:57:45,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:57:45,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:57:45" (3/3) ... [2019-11-15 19:57:45,336 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncat-alloca-2.i [2019-11-15 19:57:45,379 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 19:57:45,380 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 19:57:45,380 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 19:57:45,380 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:57:45,380 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:57:45,380 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 19:57:45,380 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:57:45,381 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 19:57:45,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 19:57:45,413 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-11-15 19:57:45,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:45,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:45,420 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 19:57:45,420 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 19:57:45,420 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 19:57:45,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 19:57:45,423 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-11-15 19:57:45,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:45,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:45,423 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 19:57:45,424 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 19:57:45,431 INFO L791 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 19#L531true assume !(main_~length1~0 < 1); 24#L531-2true assume !(main_~length2~0 < 1); 14#L534-1true assume !(main_~n~0 < 1); 6#L537-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 20#L544-3true [2019-11-15 19:57:45,431 INFO L793 eck$LassoCheckResult]: Loop: 20#L544-3true assume !!(main_~i~0 < main_~length1~0 - main_~n~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 17#L544-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 20#L544-3true [2019-11-15 19:57:45,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-15 19:57:45,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:45,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430397413] [2019-11-15 19:57:45,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,578 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:45,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:45,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2019-11-15 19:57:45,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:45,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706153442] [2019-11-15 19:57:45,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,596 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:45,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:45,598 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2019-11-15 19:57:45,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:45,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290941223] [2019-11-15 19:57:45,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,654 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:46,108 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-15 19:57:46,233 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 19:57:46,245 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:57:46,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:57:46,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:57:46,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:57:46,248 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:57:46,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:57:46,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:57:46,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:57:46,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-2.i_Iteration1_Lasso [2019-11-15 19:57:46,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:57:46,250 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:57:46,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,446 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-15 19:57:46,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,928 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 19:57:47,052 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:57:47,057 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:57:47,060 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-11-15 19:57:47,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:47,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:47,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:47,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:47,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:47,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:47,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:47,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:47,068 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-11-15 19:57:47,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:47,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:47,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:47,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:47,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:47,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:47,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:47,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:47,073 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-11-15 19:57:47,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:47,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:47,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:47,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:47,084 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:47,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:47,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:47,098 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-11-15 19:57:47,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:47,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:47,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:47,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:47,101 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:47,101 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:47,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:47,125 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-11-15 19:57:47,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:47,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:47,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:47,126 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:47,129 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:47,129 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:47,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:47,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-11-15 19:57:47,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:47,162 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 19:57:47,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:47,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:47,169 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 19:57:47,169 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:47,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:47,223 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-11-15 19:57:47,224 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:47,224 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:47,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:47,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:47,225 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:47,226 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:47,226 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:47,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:47,229 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-11-15 19:57:47,230 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:47,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:47,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:47,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:47,255 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:47,258 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:47,331 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:57:47,427 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 19:57:47,428 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 19:57:47,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:57:47,432 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:57:47,433 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:57:47,433 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1) = -1*ULTIMATE.start_main_~nondetString1~0.offset - 1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 Supporting invariants [] [2019-11-15 19:57:47,455 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 19:57:47,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:57:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:47,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:57:47,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:47,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 19:57:47,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:47,583 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-11-15 19:57:47,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-15 19:57:47,688 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 61 states and 89 transitions. Complement of second has 7 states. [2019-11-15 19:57:47,689 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-11-15 19:57:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:57:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2019-11-15 19:57:47,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 19:57:47,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:47,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 19:57:47,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:47,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 19:57:47,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:47,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 89 transitions. [2019-11-15 19:57:47,703 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 19:57:47,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 18 states and 26 transitions. [2019-11-15 19:57:47,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 19:57:47,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 19:57:47,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-15 19:57:47,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:57:47,711 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 19:57:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-15 19:57:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 19:57:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 19:57:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-15 19:57:47,738 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 19:57:47,738 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 19:57:47,738 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 19:57:47,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-15 19:57:47,739 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 19:57:47,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:47,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:47,740 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:47,740 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 19:57:47,740 INFO L791 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 171#L531 assume !(main_~length1~0 < 1); 175#L531-2 assume !(main_~length2~0 < 1); 169#L534-1 assume !(main_~n~0 < 1); 166#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 167#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 176#L544-4 main_~i~1 := 0; 165#L549-3 [2019-11-15 19:57:47,740 INFO L793 eck$LassoCheckResult]: Loop: 165#L549-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 164#L549-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 165#L549-3 [2019-11-15 19:57:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2019-11-15 19:57:47,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:47,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479660506] [2019-11-15 19:57:47,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:47,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:47,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:47,776 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:47,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2019-11-15 19:57:47,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:47,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319091780] [2019-11-15 19:57:47,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:47,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:47,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:47,801 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:47,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:47,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2019-11-15 19:57:47,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:47,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407829288] [2019-11-15 19:57:47,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:47,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:47,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:47,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407829288] [2019-11-15 19:57:47,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:47,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:57:47,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490729419] [2019-11-15 19:57:47,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:47,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:57:47,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:57:47,932 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-15 19:57:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:48,003 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2019-11-15 19:57:48,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:57:48,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2019-11-15 19:57:48,005 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2019-11-15 19:57:48,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 37 transitions. [2019-11-15 19:57:48,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 19:57:48,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 19:57:48,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-11-15 19:57:48,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:57:48,007 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-11-15 19:57:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-11-15 19:57:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-11-15 19:57:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 19:57:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-11-15 19:57:48,009 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-15 19:57:48,009 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-15 19:57:48,009 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 19:57:48,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2019-11-15 19:57:48,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 19:57:48,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:48,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:48,011 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:48,011 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 19:57:48,011 INFO L791 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 227#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 228#L531 assume !(main_~length1~0 < 1); 232#L531-2 assume !(main_~length2~0 < 1); 226#L534-1 assume !(main_~n~0 < 1); 222#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 223#L544-3 assume !!(main_~i~0 < main_~length1~0 - main_~n~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 229#L544-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 230#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 234#L544-4 main_~i~1 := 0; 220#L549-3 [2019-11-15 19:57:48,011 INFO L793 eck$LassoCheckResult]: Loop: 220#L549-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 219#L549-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 220#L549-3 [2019-11-15 19:57:48,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1713550361, now seen corresponding path program 1 times [2019-11-15 19:57:48,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:48,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935992918] [2019-11-15 19:57:48,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,037 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:48,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:48,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 2 times [2019-11-15 19:57:48,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:48,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776086182] [2019-11-15 19:57:48,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,046 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1749424059, now seen corresponding path program 1 times [2019-11-15 19:57:48,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:48,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938636348] [2019-11-15 19:57:48,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,078 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:48,427 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-11-15 19:57:48,542 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 19:57:48,544 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:57:48,544 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:57:48,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:57:48,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:57:48,545 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:57:48,545 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:57:48,545 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:57:48,545 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:57:48,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-2.i_Iteration3_Lasso [2019-11-15 19:57:48,545 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:57:48,545 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:57:48,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,753 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-15 19:57:48,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-11-15 19:57:48,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:48,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-11-15 19:57:48,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,280 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 19:57:49,311 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:57:49,311 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:57:49,312 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-11-15 19:57:49,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:49,313 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:49,313 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:49,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:49,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:49,313 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:49,314 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:49,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:49,314 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-11-15 19:57:49,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:49,315 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:49,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:49,315 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:49,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:49,315 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:49,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:49,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:49,316 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-11-15 19:57:49,316 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:49,317 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:49,317 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:49,317 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:49,318 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:49,318 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:49,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:49,320 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-11-15 19:57:49,320 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:49,320 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:49,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:49,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:49,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:49,321 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:49,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:49,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:49,322 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-11-15 19:57:49,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:49,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:49,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:49,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:49,324 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:49,325 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:49,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:49,328 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-11-15 19:57:49,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:49,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:49,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:49,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:49,330 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:49,331 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:49,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:49,333 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-11-15 19:57:49,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:49,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:49,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:49,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:49,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:49,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:49,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:49,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:49,335 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-11-15 19:57:49,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:49,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:49,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:49,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:49,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:49,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:49,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:49,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:49,338 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-11-15 19:57:49,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:49,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:49,340 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:49,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:49,343 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:49,343 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:49,373 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:57:49,424 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-15 19:57:49,431 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-15 19:57:49,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:57:49,434 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:57:49,435 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:57:49,435 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~nondetString2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~nondetString2~0.offset Supporting invariants [] [2019-11-15 19:57:49,472 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 19:57:49,477 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:57:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:49,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:57:49,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:49,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 19:57:49,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:49,554 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-11-15 19:57:49,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 19:57:49,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 28 states and 43 transitions. Complement of second has 6 states. [2019-11-15 19:57:49,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:57:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:57:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-11-15 19:57:49,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-15 19:57:49,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:49,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 19:57:49,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:49,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 19:57:49,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:49,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2019-11-15 19:57:49,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 19:57:49,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 30 transitions. [2019-11-15 19:57:49,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 19:57:49,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 19:57:49,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-11-15 19:57:49,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:57:49,596 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 19:57:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-11-15 19:57:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-15 19:57:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 19:57:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-15 19:57:49,599 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 19:57:49,599 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 19:57:49,600 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 19:57:49,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-15 19:57:49,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 19:57:49,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:49,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:49,601 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:49,602 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 19:57:49,602 INFO L791 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 363#L531 assume !(main_~length1~0 < 1); 367#L531-2 assume !(main_~length2~0 < 1); 361#L534-1 assume !(main_~n~0 < 1); 357#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 358#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 368#L544-4 main_~i~1 := 0; 359#L549-3 assume !(main_~i~1 < main_~length2~0 - 1); 360#L549-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 353#L517-3 [2019-11-15 19:57:49,602 INFO L793 eck$LassoCheckResult]: Loop: 353#L517-3 call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 351#L517-1 assume !!(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post3.base, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 353#L517-3 [2019-11-15 19:57:49,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2019-11-15 19:57:49,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:49,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173075784] [2019-11-15 19:57:49,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:49,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:49,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:49,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:49,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2019-11-15 19:57:49,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:49,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414609313] [2019-11-15 19:57:49,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:49,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:49,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:49,639 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:49,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:49,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1696290724, now seen corresponding path program 1 times [2019-11-15 19:57:49,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:49,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254010298] [2019-11-15 19:57:49,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:49,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:49,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:49,925 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-11-15 19:57:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:50,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254010298] [2019-11-15 19:57:50,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:50,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:57:50,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846438294] [2019-11-15 19:57:50,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:50,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:57:50,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:57:50,087 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 7 states. [2019-11-15 19:57:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:50,473 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2019-11-15 19:57:50,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:57:50,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-11-15 19:57:50,477 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 19:57:50,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 42 transitions. [2019-11-15 19:57:50,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-15 19:57:50,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-15 19:57:50,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2019-11-15 19:57:50,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:57:50,478 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-15 19:57:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2019-11-15 19:57:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-11-15 19:57:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 19:57:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 19:57:50,481 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 19:57:50,481 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 19:57:50,481 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 19:57:50,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 19:57:50,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 19:57:50,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:50,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:50,483 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:50,483 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 19:57:50,483 INFO L791 eck$LassoCheckResult]: Stem: 440#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 436#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 437#L531 assume !(main_~length1~0 < 1); 441#L531-2 assume !(main_~length2~0 < 1); 435#L534-1 assume !(main_~n~0 < 1); 428#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 429#L544-3 assume !!(main_~i~0 < main_~length1~0 - main_~n~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 438#L544-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 439#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 443#L544-4 main_~i~1 := 0; 445#L549-3 assume !(main_~i~1 < main_~length2~0 - 1); 432#L549-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 433#L517-3 [2019-11-15 19:57:50,483 INFO L793 eck$LassoCheckResult]: Loop: 433#L517-3 call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 434#L517-1 assume !!(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post3.base, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 433#L517-3 [2019-11-15 19:57:50,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1749424001, now seen corresponding path program 1 times [2019-11-15 19:57:50,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:50,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877897463] [2019-11-15 19:57:50,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:50,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:50,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:50,506 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2019-11-15 19:57:50,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:50,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957100830] [2019-11-15 19:57:50,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:50,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:50,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:50,512 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:50,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1864254086, now seen corresponding path program 1 times [2019-11-15 19:57:50,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:50,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183144481] [2019-11-15 19:57:50,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:50,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:50,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:50,538 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:51,017 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 117 [2019-11-15 19:57:51,155 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 19:57:51,157 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:57:51,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:57:51,157 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:57:51,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:57:51,157 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:57:51,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:57:51,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:57:51,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:57:51,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-2.i_Iteration5_Lasso [2019-11-15 19:57:51,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:57:51,158 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:57:51,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,456 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-11-15 19:57:51,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,871 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-11-15 19:57:52,223 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 19:57:52,349 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:57:52,349 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:57:52,349 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-11-15 19:57:52,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,351 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,351 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,354 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-11-15 19:57:52,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,355 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,355 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,356 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-11-15 19:57:52,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,356 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,357 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-11-15 19:57:52,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,359 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,359 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,362 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-11-15 19:57:52,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,364 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,365 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-11-15 19:57:52,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,366 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,367 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-11-15 19:57:52,368 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,368 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,369 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,369 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,370 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-11-15 19:57:52,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,371 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,372 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,372 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,373 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-11-15 19:57:52,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,375 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-11-15 19:57:52,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,377 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,377 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,379 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-11-15 19:57:52,379 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,380 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,380 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,380 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,381 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,382 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-11-15 19:57:52,382 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,382 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,383 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,383 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,384 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-11-15 19:57:52,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,387 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-11-15 19:57:52,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,388 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,389 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-11-15 19:57:52,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,390 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,391 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,391 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,392 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-11-15 19:57:52,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,393 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,393 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,394 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,394 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,395 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-11-15 19:57:52,395 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,395 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,396 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,396 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,397 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-11-15 19:57:52,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,399 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,400 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-11-15 19:57:52,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,401 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,401 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,402 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,403 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-11-15 19:57:52,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,404 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,405 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-11-15 19:57:52,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,407 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,407 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,407 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,409 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-11-15 19:57:52,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,410 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,411 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,411 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,412 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-11-15 19:57:52,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,412 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,413 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,413 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,413 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,414 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-11-15 19:57:52,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,415 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,416 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,416 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,417 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-11-15 19:57:52,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,418 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,419 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-11-15 19:57:52,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:52,421 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,422 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-11-15 19:57:52,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,424 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,424 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,426 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-11-15 19:57:52,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,428 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,428 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,430 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-11-15 19:57:52,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,431 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 19:57:52,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,435 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 19:57:52,435 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,450 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-11-15 19:57:52,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,451 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,452 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,452 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,457 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-11-15 19:57:52,458 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,458 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,458 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,459 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,459 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,461 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-11-15 19:57:52,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:52,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,463 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 19:57:52,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,463 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 19:57:52,464 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:52,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,466 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-11-15 19:57:52,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,468 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,469 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:52,472 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-11-15 19:57:52,472 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:52,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:52,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:52,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:52,476 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:52,476 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:52,528 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:57:52,566 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 19:57:52,568 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 19:57:52,569 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:57:52,570 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:57:52,571 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:57:52,571 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2019-11-15 19:57:52,601 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 19:57:52,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:57:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:52,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:57:52,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:52,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:57:52,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:52,666 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-11-15 19:57:52,666 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 19:57:52,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 38 states and 54 transitions. Complement of second has 6 states. [2019-11-15 19:57:52,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:57:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:57:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-11-15 19:57:52,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 19:57:52,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:52,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 19:57:52,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:52,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-15 19:57:52,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:52,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. [2019-11-15 19:57:52,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:57:52,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 44 transitions. [2019-11-15 19:57:52,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 19:57:52,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 19:57:52,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-11-15 19:57:52,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:57:52,699 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-15 19:57:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-11-15 19:57:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-15 19:57:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 19:57:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-15 19:57:52,707 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-15 19:57:52,707 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-15 19:57:52,707 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 19:57:52,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-11-15 19:57:52,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:57:52,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:52,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:52,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:52,711 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:57:52,711 INFO L791 eck$LassoCheckResult]: Stem: 598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 594#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 595#L531 assume !(main_~length1~0 < 1); 599#L531-2 assume !(main_~length2~0 < 1); 593#L534-1 assume !(main_~n~0 < 1); 585#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 586#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 600#L544-4 main_~i~1 := 0; 587#L549-3 assume !(main_~i~1 < main_~length2~0 - 1); 588#L549-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 590#L517-3 call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 578#L517-1 assume !(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2; 579#L519-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 582#L519 assume !cstrncat_#t~short6; 603#L519-2 assume !!cstrncat_#t~short6;havoc cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 608#L519-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 581#L519 [2019-11-15 19:57:52,711 INFO L793 eck$LassoCheckResult]: Loop: 581#L519 assume !cstrncat_#t~short6; 602#L519-2 assume !!cstrncat_#t~short6;havoc cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 580#L519-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 581#L519 [2019-11-15 19:57:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash 849587260, now seen corresponding path program 1 times [2019-11-15 19:57:52,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:52,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547339848] [2019-11-15 19:57:52,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:52,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:52,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:52,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547339848] [2019-11-15 19:57:52,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:52,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:52,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45895378] [2019-11-15 19:57:52,782 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:57:52,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:52,783 INFO L82 PathProgramCache]: Analyzing trace with hash 104447, now seen corresponding path program 1 times [2019-11-15 19:57:52,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:52,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875000015] [2019-11-15 19:57:52,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:52,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:52,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:52,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875000015] [2019-11-15 19:57:52,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:52,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:57:52,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108341584] [2019-11-15 19:57:52,792 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 19:57:52,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:57:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:57:52,793 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-15 19:57:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:52,805 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-11-15 19:57:52,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:57:52,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-11-15 19:57:52,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 19:57:52,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-11-15 19:57:52,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 19:57:52,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 19:57:52,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 19:57:52,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:57:52,807 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:57:52,807 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:57:52,807 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:57:52,807 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 19:57:52,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 19:57:52,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 19:57:52,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 19:57:52,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 07:57:52 BoogieIcfgContainer [2019-11-15 19:57:52,817 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 19:57:52,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 19:57:52,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 19:57:52,817 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 19:57:52,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:57:45" (3/4) ... [2019-11-15 19:57:52,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 19:57:52,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 19:57:52,824 INFO L168 Benchmark]: Toolchain (without parser) took 8567.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 937.1 MB in the beginning and 982.1 MB in the end (delta: -45.0 MB). Peak memory consumption was 135.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:52,825 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:57:52,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:52,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:52,832 INFO L168 Benchmark]: Boogie Preprocessor took 41.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:57:52,833 INFO L168 Benchmark]: RCFGBuilder took 431.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:52,833 INFO L168 Benchmark]: BuchiAutomizer took 7489.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 988.4 MB in the end (delta: 85.4 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:52,834 INFO L168 Benchmark]: Witness Printer took 5.06 ms. Allocated memory is still 1.2 GB. Free memory was 988.4 MB in the beginning and 982.1 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:52,843 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 530.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 431.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7489.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 988.4 MB in the end (delta: 85.4 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.06 ms. Allocated memory is still 1.2 GB. Free memory was 988.4 MB in the beginning and 982.1 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * nondetString1 + -1 * i + unknown-#length-unknown[nondetString1] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * i + -1 * nondetString2 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 121 SDtfs, 151 SDslu, 138 SDs, 0 SdLazy, 141 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital176 mio100 ax110 hnf98 lsp85 ukn76 mio100 lsp56 div100 bol100 ite100 ukn100 eq169 hnf90 smp98 dnf142 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...