./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.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_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/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 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:24:34,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:24:34,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:24:34,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:24:34,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:24:34,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:24:34,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:24:34,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:24:34,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:24:34,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:24:34,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:24:34,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:24:34,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:24:34,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:24:34,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:24:34,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:24:34,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:24:34,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:24:34,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:24:34,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:24:34,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:24:34,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:24:34,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:24:34,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:24:34,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:24:34,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:24:34,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:24:34,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:24:34,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:24:34,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:24:34,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:24:34,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:24:34,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:24:34,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:24:34,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:24:34,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:24:34,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:24:34,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:24:34,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:24:34,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:24:34,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:24:34,077 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:24:34,093 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:24:34,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:24:34,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:24:34,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:24:34,095 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:24:34,095 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:24:34,096 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:24:34,096 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:24:34,096 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:24:34,096 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:24:34,097 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:24:34,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:24:34,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:24:34,097 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:24:34,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:24:34,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:24:34,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:24:34,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:24:34,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:24:34,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:24:34,099 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:24:34,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:24:34,100 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:24:34,100 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:24:34,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:24:34,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:24:34,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:24:34,101 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:24:34,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:24:34,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:24:34,102 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:24:34,103 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:24:34,103 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_781cad8e-1552-4071-950a-70a89be2986b/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 -> 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf [2019-11-15 23:24:34,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:24:34,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:24:34,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:24:34,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:24:34,145 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:24:34,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2019-11-15 23:24:34,200 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/data/83b53ed08/1202e8f6812c4cf88edccac807280c8c/FLAG35179be30 [2019-11-15 23:24:34,656 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:24:34,658 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2019-11-15 23:24:34,677 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/data/83b53ed08/1202e8f6812c4cf88edccac807280c8c/FLAG35179be30 [2019-11-15 23:24:34,939 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/bin/uautomizer/data/83b53ed08/1202e8f6812c4cf88edccac807280c8c [2019-11-15 23:24:34,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:24:34,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:24:34,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:34,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:24:34,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:24:34,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:34" (1/1) ... [2019-11-15 23:24:34,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be8446e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:34, skipping insertion in model container [2019-11-15 23:24:34,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:34" (1/1) ... [2019-11-15 23:24:34,957 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:24:34,990 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:24:35,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:35,328 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:24:35,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:35,445 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:24:35,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35 WrapperNode [2019-11-15 23:24:35,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:35,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:35,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:24:35,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:24:35,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:35,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:24:35,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:24:35,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:24:35,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:24:35,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:24:35,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:24:35,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:24:35,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_781cad8e-1552-4071-950a-70a89be2986b/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 23:24:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:24:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:24:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:24:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:24:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2019-11-15 23:24:35,607 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2019-11-15 23:24:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:24:35,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:24:35,900 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:24:35,900 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:24:35,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:35 BoogieIcfgContainer [2019-11-15 23:24:35,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:24:35,902 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:24:35,903 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:24:35,906 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:24:35,907 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:35,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:24:34" (1/3) ... [2019-11-15 23:24:35,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f0967dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:24:35, skipping insertion in model container [2019-11-15 23:24:35,908 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:35,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (2/3) ... [2019-11-15 23:24:35,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f0967dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:24:35, skipping insertion in model container [2019-11-15 23:24:35,909 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:35,909 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:35" (3/3) ... [2019-11-15 23:24:35,910 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_strlen-alloca-1.i [2019-11-15 23:24:35,951 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:24:35,951 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:24:35,951 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:24:35,951 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:24:35,951 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:24:35,951 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:24:35,951 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:24:35,952 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:24:35,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:24:35,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:24:35,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:35,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:35,998 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:24:35,998 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:35,998 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:24:35,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:24:36,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:24:36,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:36,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:36,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:24:36,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:36,009 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 11#L522true assume !(main_~length1~0 < 1); 16#L522-2true call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 5#L527-3true [2019-11-15 23:24:36,009 INFO L793 eck$LassoCheckResult]: Loop: 5#L527-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; 4#L527-2true main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 5#L527-3true [2019-11-15 23:24:36,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 23:24:36,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:36,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450867075] [2019-11-15 23:24:36,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:36,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:36,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:36,151 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-15 23:24:36,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:36,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368392786] [2019-11-15 23:24:36,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:36,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:36,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:36,174 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:36,175 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-15 23:24:36,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:36,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336364455] [2019-11-15 23:24:36,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:36,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:36,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:36,219 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:36,482 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:24:36,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:24:36,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:24:36,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:24:36,483 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:24:36,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:24:36,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:24:36,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:24:36,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strlen-alloca-1.i_Iteration1_Lasso [2019-11-15 23:24:36,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:24:36,484 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:24:36,509 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 23:24:36,516 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 23:24:36,518 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 23:24:36,521 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 23:24:36,541 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 23:24:36,564 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 23:24:36,576 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 23:24:36,580 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 23:24:36,584 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 23:24:36,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:37,149 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:24:37,154 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:24:37,156 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 23:24:37,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,158 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:37,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,163 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:37,164 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:37,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,171 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 23:24:37,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:37,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:37,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:37,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,180 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 23:24:37,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:37,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:37,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:37,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,198 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 23:24:37,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,203 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:37,205 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:37,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,210 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 23:24:37,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,214 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:37,214 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:37,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,219 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 23:24:37,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,223 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:37,223 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:37,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,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 23:24:37,230 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,233 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:37,233 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:37,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,237 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 23:24:37,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,241 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:37,241 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:37,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,247 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 23:24:37,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:37,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,249 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:37,249 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:37,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,250 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 23:24:37,251 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,251 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:24:37,252 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,255 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:24:37,255 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:37,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,286 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 23:24:37,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,288 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:37,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,290 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:37,290 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:37,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:37,293 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 23:24:37,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:37,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:37,298 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:37,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:37,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:37,313 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:37,410 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:24:37,440 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:24:37,445 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:24:37,448 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:24:37,450 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:24:37,453 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:24:37,454 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:24:37,474 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:24:37,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:37,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:24:37,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:37,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:24:37,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:37,564 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 23:24:37,580 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 23:24:37,582 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-15 23:24:37,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 34 states and 43 transitions. Complement of second has 9 states. [2019-11-15 23:24:37,641 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 23:24:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:24:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-15 23:24:37,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 23:24:37,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:37,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 23:24:37,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:37,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-15 23:24:37,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:37,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2019-11-15 23:24:37,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:37,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 12 states and 15 transitions. [2019-11-15 23:24:37,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:24:37,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:24:37,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-11-15 23:24:37,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:37,663 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 23:24:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-11-15 23:24:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 23:24:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:24:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-15 23:24:37,691 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 23:24:37,691 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 23:24:37,691 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:24:37,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-11-15 23:24:37,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:37,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:37,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:37,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:37,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:37,694 INFO L791 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 112#L522 assume !(main_~length1~0 < 1); 118#L522-2 call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 119#L527-3 assume !(main_~i~0 < main_~length1~0 - 1); 122#L527-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1); 114#L533 call main_#t~ret8 := strlen_rec(main_~nondetString1~0.base, main_~nondetString1~0.offset);< 115#strlen_recENTRY [2019-11-15 23:24:37,694 INFO L793 eck$LassoCheckResult]: Loop: 115#strlen_recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 1); 117#L515 assume !(0 == #t~mem2);havoc #t~mem2; 113#L518 call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset);< 115#strlen_recENTRY [2019-11-15 23:24:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1806816568, now seen corresponding path program 1 times [2019-11-15 23:24:37,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:37,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342374521] [2019-11-15 23:24:37,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:37,729 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash 58722, now seen corresponding path program 1 times [2019-11-15 23:24:37,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:37,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041657388] [2019-11-15 23:24:37,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:37,751 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1952714549, now seen corresponding path program 1 times [2019-11-15 23:24:37,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:37,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599363264] [2019-11-15 23:24:37,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,016 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 23:24:38,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599363264] [2019-11-15 23:24:38,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:38,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:24:38,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136115148] [2019-11-15 23:24:38,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:38,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:24:38,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:24:38,165 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-15 23:24:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:38,257 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-15 23:24:38,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:24:38,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-15 23:24:38,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:38,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 15 transitions. [2019-11-15 23:24:38,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:24:38,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:24:38,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-11-15 23:24:38,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:38,261 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 23:24:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-11-15 23:24:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 23:24:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:24:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-15 23:24:38,263 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-15 23:24:38,263 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-15 23:24:38,263 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:24:38,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-11-15 23:24:38,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:38,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:38,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:38,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:38,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:38,265 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 158#L522 assume !(main_~length1~0 < 1); 164#L522-2 call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 165#L527-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; 166#L527-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 167#L527-3 assume !(main_~i~0 < main_~length1~0 - 1); 168#L527-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1); 160#L533 call main_#t~ret8 := strlen_rec(main_~nondetString1~0.base, main_~nondetString1~0.offset);< 161#strlen_recENTRY [2019-11-15 23:24:38,265 INFO L793 eck$LassoCheckResult]: Loop: 161#strlen_recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 1); 163#L515 assume !(0 == #t~mem2);havoc #t~mem2; 159#L518 call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset);< 161#strlen_recENTRY [2019-11-15 23:24:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:38,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641750, now seen corresponding path program 1 times [2019-11-15 23:24:38,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:38,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188991923] [2019-11-15 23:24:38,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:38,287 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:38,288 INFO L82 PathProgramCache]: Analyzing trace with hash 58722, now seen corresponding path program 2 times [2019-11-15 23:24:38,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:38,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353312941] [2019-11-15 23:24:38,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:38,297 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash -357639123, now seen corresponding path program 1 times [2019-11-15 23:24:38,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:38,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142714303] [2019-11-15 23:24:38,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:38,324 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:38,603 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-11-15 23:24:38,812 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:24:38,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:24:38,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:24:38,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:24:38,813 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:24:38,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:24:38,813 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:24:38,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:24:38,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strlen-alloca-1.i_Iteration3_Lasso [2019-11-15 23:24:38,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:24:38,813 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:24:38,817 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 23:24:38,821 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 23:24:38,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:38,825 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 23:24:38,826 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 23:24:38,828 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 23:24:38,831 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 23:24:38,833 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 23:24:38,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:38,838 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 23:24:38,840 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 23:24:38,842 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 23:24:38,843 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 23:24:38,846 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 23:24:38,847 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 23:24:38,849 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 23:24:38,850 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 23:24:38,909 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 23:24:38,911 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 23:24:38,913 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 23:24:38,915 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 23:24:38,916 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 23:24:38,918 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 23:24:38,920 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 23:24:38,921 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 23:24:38,923 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 23:24:38,926 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 23:24:38,927 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 23:24:39,113 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:24:39,113 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:24:39,113 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 23:24:39,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,116 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 23:24:39,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,117 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,117 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,118 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,118 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,119 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 23:24:39,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,120 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,121 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 23:24:39,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,121 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,122 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,122 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,123 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 23:24:39,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,124 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,124 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,125 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:39,125 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:39,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:24:39,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,128 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,129 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 23:24:39,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,130 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,130 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,130 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,131 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 23:24:39,132 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,132 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,132 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,132 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,133 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,133 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,134 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 23:24:39,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,134 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,134 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,134 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,135 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,135 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,135 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,136 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 23:24:39,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,138 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:39,138 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:39,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:24:39,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,141 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,142 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,143 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 23:24:39,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,144 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,145 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,145 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 23:24:39,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,147 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,147 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,162 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 23:24:39,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,162 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,163 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,164 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 23:24:39,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:39,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,166 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 23:24:39,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,167 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:39,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,167 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:24:39,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,168 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:24:39,168 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:39,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,170 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 23:24:39,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,172 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:39,172 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:39,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,174 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 23:24:39,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,175 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:24:39,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,177 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:24:39,177 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:39,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:39,182 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 23:24:39,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:39,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:39,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:39,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:39,196 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:39,196 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:39,233 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:24:39,249 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:24:39,252 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:24:39,254 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:24:39,255 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:24:39,255 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:24:39,256 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(strlen_rec_#in~p.offset, v_rep(select #length strlen_rec_#in~p.base)_1) = -1*strlen_rec_#in~p.offset + 1*v_rep(select #length strlen_rec_#in~p.base)_1 Supporting invariants [] [2019-11-15 23:24:39,262 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:24:39,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:24:39,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:39,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:24:39,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:39,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:24:39,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:39,360 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 23:24:39,361 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 23:24:39,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 23:24:39,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 21 transitions. Complement of second has 7 states. [2019-11-15 23:24:39,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:24:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:24:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-11-15 23:24:39,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 23:24:39,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:39,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-15 23:24:39,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:39,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 23:24:39,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:39,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-11-15 23:24:39,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:24:39,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-11-15 23:24:39,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:24:39,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:24:39,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:24:39,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:39,397 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:24:39,397 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:24:39,397 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:24:39,398 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:24:39,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:24:39,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:24:39,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:24:39,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:24:39 BoogieIcfgContainer [2019-11-15 23:24:39,404 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:24:39,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:24:39,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:24:39,404 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:24:39,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:35" (3/4) ... [2019-11-15 23:24:39,408 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:24:39,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:24:39,410 INFO L168 Benchmark]: Toolchain (without parser) took 4467.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -87.2 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:39,410 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:24:39,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:39,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.23 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 23:24:39,412 INFO L168 Benchmark]: Boogie Preprocessor took 26.77 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 23:24:39,413 INFO L168 Benchmark]: RCFGBuilder took 373.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:39,413 INFO L168 Benchmark]: BuchiAutomizer took 3501.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.2 MB). Peak memory consumption was 73.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:39,414 INFO L168 Benchmark]: Witness Printer took 4.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:24:39,417 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 504.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.77 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. * RCFGBuilder took 373.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3501.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.2 MB). Peak memory consumption was 73.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * p + unknown-#length-unknown[p] and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 31 SDslu, 21 SDs, 0 SdLazy, 53 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax118 hnf99 lsp79 ukn71 mio100 lsp58 div100 bol100 ite100 ukn100 eq155 hnf92 smp96 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...