./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/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/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-10-22 08:58:44,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:44,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:44,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:44,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:44,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:44,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:44,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:44,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:44,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:44,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:44,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:44,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:44,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:44,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:44,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:44,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:44,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:44,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:44,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:44,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:44,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:44,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:44,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:44,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:44,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:44,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:44,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:44,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:44,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:44,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:44,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:44,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:44,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:44,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:44,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:44,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:44,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:44,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:44,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:44,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:44,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:58:44,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:44,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:44,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:44,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:44,293 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:44,293 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:44,293 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:44,294 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:44,294 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:44,294 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:44,294 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:44,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:44,295 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:44,295 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:44,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:44,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:44,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:44,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:44,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:44,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:44,296 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:44,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:44,297 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:44,297 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:44,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:44,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:44,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:44,298 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:44,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:44,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:44,299 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:44,300 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:44,300 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/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-10-22 08:58:44,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:44,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:44,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:44,339 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:44,340 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:44,340 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2019-10-22 08:58:44,393 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/data/82e43e612/1764730d6d3f406bbcbed4a296bf36c7/FLAG90ef5ec78 [2019-10-22 08:58:44,872 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:44,873 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2019-10-22 08:58:44,889 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/data/82e43e612/1764730d6d3f406bbcbed4a296bf36c7/FLAG90ef5ec78 [2019-10-22 08:58:45,142 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/data/82e43e612/1764730d6d3f406bbcbed4a296bf36c7 [2019-10-22 08:58:45,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:45,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:45,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:45,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:45,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:45,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cdc7a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45, skipping insertion in model container [2019-10-22 08:58:45,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,161 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:45,203 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:45,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:45,581 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:45,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:45,662 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:45,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45 WrapperNode [2019-10-22 08:58:45,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:45,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:45,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:45,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:45,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:45,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:45,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:45,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:45,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... [2019-10-22 08:58:45,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:45,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:45,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:45,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:45,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7757de0d-d829-4f92-9774-49d643a44325/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2019-10-22 08:58:45,796 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2019-10-22 08:58:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:45,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:46,027 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:46,027 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:58:46,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:46 BoogieIcfgContainer [2019-10-22 08:58:46,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:46,029 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:46,029 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:46,034 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:46,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:46,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:45" (1/3) ... [2019-10-22 08:58:46,036 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@184fd7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:46, skipping insertion in model container [2019-10-22 08:58:46,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:46,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:45" (2/3) ... [2019-10-22 08:58:46,037 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@184fd7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:46, skipping insertion in model container [2019-10-22 08:58:46,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:46,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:46" (3/3) ... [2019-10-22 08:58:46,039 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_strlen-alloca-1.i [2019-10-22 08:58:46,086 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:46,086 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:46,086 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:46,086 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:46,087 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:46,087 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:46,087 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:46,087 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:46,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:58:46,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:58:46,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:46,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:46,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:58:46,125 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:46,125 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:46,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:58:46,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:58:46,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:46,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:46,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:58:46,127 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:46,134 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-10-22 08:58:46,134 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-10-22 08:58:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:58:46,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330470304] [2019-10-22 08:58:46,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,247 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 08:58:46,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897339088] [2019-10-22 08:58:46,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,266 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:46,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,268 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 08:58:46,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540627255] [2019-10-22 08:58:46,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,300 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:46,465 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:46,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:46,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:46,467 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:46,467 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:46,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:46,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:46,467 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:46,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strlen-alloca-1.i_Iteration1_Lasso [2019-10-22 08:58:46,468 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:46,468 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:46,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:46,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:46,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:46,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-10-22 08:58:46,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:46,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:46,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:46,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:46,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:46,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:46,909 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:46,913 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:46,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:46,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,917 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,920 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,920 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:46,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,923 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:46,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,934 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,934 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:46,939 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,942 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:46,944 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:46,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:46,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,963 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:46,963 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:46,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:46,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,979 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:46,979 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:46,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:46,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,997 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:46,997 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:47,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:47,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:47,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:47,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:47,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:47,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:47,013 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:47,013 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:47,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:47,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:47,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:47,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:47,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:47,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:47,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:47,022 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:47,027 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:47,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:47,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:47,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:47,029 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:58:47,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:47,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:47,035 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:58:47,041 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:47,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:47,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:47,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:47,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:47,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:47,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:47,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:47,072 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:47,072 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:47,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:47,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:47,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:47,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:47,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:47,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:47,080 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:47,080 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:47,135 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:47,154 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:47,161 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:47,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:47,165 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:47,165 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:47,166 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:58:47,189 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:58:47,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:47,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:47,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:47,263 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:58:47,265 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-10-22 08:58:47,320 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-10-22 08:58:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-10-22 08:58:47,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:58:47,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:47,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:58:47,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:47,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:58:47,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:47,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2019-10-22 08:58:47,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:47,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 12 states and 15 transitions. [2019-10-22 08:58:47,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:58:47,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:58:47,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-10-22 08:58:47,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:47,341 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 08:58:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-10-22 08:58:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 08:58:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 08:58:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-10-22 08:58:47,373 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 08:58:47,373 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 08:58:47,373 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:47,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-10-22 08:58:47,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:47,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:47,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:47,375 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:47,375 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:47,375 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-10-22 08:58:47,375 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-10-22 08:58:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1806816568, now seen corresponding path program 1 times [2019-10-22 08:58:47,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345336407] [2019-10-22 08:58:47,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,415 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash 58722, now seen corresponding path program 1 times [2019-10-22 08:58:47,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251981788] [2019-10-22 08:58:47,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,439 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:47,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1952714549, now seen corresponding path program 1 times [2019-10-22 08:58:47,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979408317] [2019-10-22 08:58:47,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:47,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979408317] [2019-10-22 08:58:47,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:47,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:58:47,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438370631] [2019-10-22 08:58:47,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:58:47,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:58:47,712 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-10-22 08:58:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:47,808 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-10-22 08:58:47,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:58:47,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-10-22 08:58:47,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:47,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 15 transitions. [2019-10-22 08:58:47,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:58:47,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:58:47,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-10-22 08:58:47,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:47,812 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:58:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-10-22 08:58:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-10-22 08:58:47,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 08:58:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-10-22 08:58:47,813 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-10-22 08:58:47,813 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-10-22 08:58:47,813 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:47,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-10-22 08:58:47,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:47,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:47,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:47,818 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:47,818 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:47,819 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-10-22 08:58:47,819 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-10-22 08:58:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641750, now seen corresponding path program 1 times [2019-10-22 08:58:47,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099179770] [2019-10-22 08:58:47,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,857 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:47,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,861 INFO L82 PathProgramCache]: Analyzing trace with hash 58722, now seen corresponding path program 2 times [2019-10-22 08:58:47,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305013556] [2019-10-22 08:58:47,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,875 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash -357639123, now seen corresponding path program 1 times [2019-10-22 08:58:47,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851933448] [2019-10-22 08:58:47,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:47,915 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:48,137 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-22 08:58:48,300 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:48,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:48,300 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:48,300 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:48,301 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:48,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:48,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:48,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:48,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strlen-alloca-1.i_Iteration3_Lasso [2019-10-22 08:58:48,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:48,301 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:48,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:48,548 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:48,548 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:48,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,550 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,552 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,552 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,552 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,554 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,554 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,554 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,555 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,557 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,557 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,558 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,560 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:48,561 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:48,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,563 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,563 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,564 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,564 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,566 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,566 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,569 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,569 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,570 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,571 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,574 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:48,574 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:48,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,579 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,579 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,586 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,587 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,587 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,587 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,594 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,594 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,594 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,594 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:48,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:48,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,596 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:48,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,597 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:58:48,597 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:48,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,604 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,605 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:48,605 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:48,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,608 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,608 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:58:48,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,610 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:58:48,610 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:48,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:48,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:48,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:48,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:48,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:48,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:48,617 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:48,617 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:48,631 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:48,640 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:58:48,640 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:58:48,640 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:48,641 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:48,641 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:48,642 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-10-22 08:58:48,643 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:58:48,645 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:48,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:48,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:48,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:58:48,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:48,696 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:58:48,696 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:58:48,721 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-10-22 08:58:48,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-10-22 08:58:48,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:58:48,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:48,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2019-10-22 08:58:48,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:48,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 08:58:48,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:48,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-10-22 08:58:48,725 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:48,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-10-22 08:58:48,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:48,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:48,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:48,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:48,726 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:48,726 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:48,726 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:48,726 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:48,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:48,727 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:48,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:48,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:48 BoogieIcfgContainer [2019-10-22 08:58:48,733 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:48,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:48,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:48,734 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:48,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:46" (3/4) ... [2019-10-22 08:58:48,738 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:48,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:48,740 INFO L168 Benchmark]: Toolchain (without parser) took 3593.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.3 MB in the beginning and 1.0 GB in the end (delta: -90.6 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,740 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:48,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.19 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: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,742 INFO L168 Benchmark]: Boogie Preprocessor took 22.26 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: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,743 INFO L168 Benchmark]: RCFGBuilder took 297.12 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,743 INFO L168 Benchmark]: BuchiAutomizer took 2704.24 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: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,744 INFO L168 Benchmark]: Witness Printer took 4.62 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-10-22 08:58:48,747 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 516.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.19 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: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.26 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: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.12 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2704.24 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: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.62 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 2.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 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: 41ms 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...