./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0e48acfd964328d443bb00db1a9e4c58c0207581 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:36:21,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:36:21,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:36:21,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:36:21,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:36:21,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:36:21,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:36:21,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:36:21,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:36:21,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:36:21,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:36:21,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:36:21,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:36:21,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:36:21,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:36:21,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:36:21,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:36:21,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:36:21,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:36:21,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:36:21,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:36:21,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:36:21,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:36:21,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:36:21,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:36:21,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:36:21,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:36:21,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:36:21,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:36:21,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:36:21,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:36:21,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:36:21,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:36:21,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:36:21,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:36:21,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:36:21,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:36:21,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:36:21,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:36:21,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:36:21,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:36:21,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:36:21,330 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:36:21,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:36:21,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:36:21,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:36:21,335 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:36:21,337 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:36:21,337 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:36:21,337 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:36:21,338 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:36:21,338 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:36:21,338 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:36:21,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:36:21,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:36:21,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:36:21,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:36:21,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:36:21,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:36:21,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:36:21,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:36:21,341 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:36:21,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:36:21,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:36:21,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:36:21,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:36:21,343 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:36:21,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:36:21,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:36:21,344 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:36:21,345 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:36:21,346 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:36:21,347 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e48acfd964328d443bb00db1a9e4c58c0207581 [2019-11-28 20:36:21,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:36:21,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:36:21,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:36:21,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:36:21,656 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:36:21,657 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i [2019-11-28 20:36:21,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9708e6581/e7e08e06e9f545d79db0f921ffbd861c/FLAG3e26382f8 [2019-11-28 20:36:22,301 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:36:22,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i [2019-11-28 20:36:22,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9708e6581/e7e08e06e9f545d79db0f921ffbd861c/FLAG3e26382f8 [2019-11-28 20:36:22,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9708e6581/e7e08e06e9f545d79db0f921ffbd861c [2019-11-28 20:36:22,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:36:22,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:36:22,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:36:22,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:36:22,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:36:22,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:22" (1/1) ... [2019-11-28 20:36:22,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad64629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:22, skipping insertion in model container [2019-11-28 20:36:22,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:22" (1/1) ... [2019-11-28 20:36:22,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:36:22,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:36:23,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:36:23,067 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:36:23,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:36:23,227 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:36:23,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23 WrapperNode [2019-11-28 20:36:23,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:36:23,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:36:23,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:36:23,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:36:23,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... [2019-11-28 20:36:23,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... [2019-11-28 20:36:23,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:36:23,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:36:23,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:36:23,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:36:23,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... [2019-11-28 20:36:23,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... [2019-11-28 20:36:23,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... [2019-11-28 20:36:23,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... [2019-11-28 20:36:23,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... [2019-11-28 20:36:23,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... [2019-11-28 20:36:23,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... [2019-11-28 20:36:23,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:36:23,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:36:23,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:36:23,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:36:23,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:23,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:36:23,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:36:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:36:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:36:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:36:23,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:36:23,744 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:36:23,745 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:36:23,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:23 BoogieIcfgContainer [2019-11-28 20:36:23,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:36:23,747 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:36:23,747 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:36:23,751 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:36:23,752 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:36:23,752 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:36:22" (1/3) ... [2019-11-28 20:36:23,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e7043a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:36:23, skipping insertion in model container [2019-11-28 20:36:23,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:36:23,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:23" (2/3) ... [2019-11-28 20:36:23,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e7043a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:36:23, skipping insertion in model container [2019-11-28 20:36:23,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:36:23,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:23" (3/3) ... [2019-11-28 20:36:23,756 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncat_diffterm_alloca.i [2019-11-28 20:36:23,795 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:36:23,795 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:36:23,795 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:36:23,795 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:36:23,795 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:36:23,796 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:36:23,796 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:36:23,796 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:36:23,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 20:36:23,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 20:36:23,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:23,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:23,840 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:36:23,840 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:36:23,840 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:36:23,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 20:36:23,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 20:36:23,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:23,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:23,843 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:36:23,844 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:36:23,852 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 15#L381true assume !(main_~length1~0 < 1); 18#L381-2true assume !(main_~length2~0 < 1); 11#L384-1true assume !(main_~n~0 < 1); 5#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 8#L367-3true [2019-11-28 20:36:23,852 INFO L796 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 3#L367-1true assume !!(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, 1 + cstrncat_#t~post206.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 8#L367-3true [2019-11-28 20:36:23,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:23,859 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-28 20:36:23,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:23,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343164103] [2019-11-28 20:36:23,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:24,041 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-11-28 20:36:24,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:24,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633544628] [2019-11-28 20:36:24,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:24,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-11-28 20:36:24,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:24,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793669472] [2019-11-28 20:36:24,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:24,121 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:24,696 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-11-28 20:36:24,854 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-28 20:36:24,869 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:36:24,870 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:36:24,870 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:36:24,871 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:36:24,871 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:36:24,871 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,871 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:36:24,872 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:36:24,872 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncat_diffterm_alloca.i_Iteration1_Lasso [2019-11-28 20:36:24,872 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:36:24,873 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:36:24,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:24,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:24,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:24,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:24,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,278 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-28 20:36:25,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,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-11-28 20:36:25,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-11-28 20:36:25,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,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-11-28 20:36:25,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-11-28 20:36:25,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,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-11-28 20:36:25,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:25,962 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:36:25,968 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:25,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:25,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:25,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:25,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:25,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:25,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:25,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:25,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:25,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:26,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:26,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:26,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:26,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:26,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:26,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:26,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:26,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:26,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:26,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:26,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:26,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:26,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:26,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:26,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:26,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:26,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:26,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:26,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:26,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:26,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:26,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:26,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:26,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:26,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:26,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:26,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:26,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:26,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:26,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:26,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:26,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:26,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:26,140 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:36:26,244 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-28 20:36:26,245 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:26,316 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:26,321 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:36:26,321 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:36:26,322 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2019-11-28 20:36:26,460 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 20:36:26,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:36:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:26,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:36:26,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:26,558 WARN L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:36:26,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:26,598 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:36:26,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-28 20:36:26,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 50 states and 73 transitions. Complement of second has 8 states. [2019-11-28 20:36:26,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:36:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:36:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2019-11-28 20:36:26,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 20:36:26,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:26,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 20:36:26,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:26,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:36:26,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:26,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 73 transitions. [2019-11-28 20:36:26,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:36:26,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 20 states and 27 transitions. [2019-11-28 20:36:26,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:36:26,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:36:26,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-28 20:36:26,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:36:26,735 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 20:36:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-28 20:36:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-28 20:36:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:36:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-28 20:36:26,766 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 20:36:26,766 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 20:36:26,766 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:36:26,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-28 20:36:26,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:36:26,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:26,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:26,768 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:26,768 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:36:26,769 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 161#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 162#L381 assume !(main_~length1~0 < 1); 167#L381-2 assume !(main_~length2~0 < 1); 177#L384-1 assume !(main_~n~0 < 1); 172#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 173#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 163#L367-1 assume !(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 164#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 179#L369 assume !cstrncat_#t~short209; 175#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 178#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 169#L369 [2019-11-28 20:36:26,769 INFO L796 eck$LassoCheckResult]: Loop: 169#L369 assume !cstrncat_#t~short209; 174#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 168#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 169#L369 [2019-11-28 20:36:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-11-28 20:36:26,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:26,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535718060] [2019-11-28 20:36:26,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:26,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535718060] [2019-11-28 20:36:26,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:36:26,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:36:26,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253408840] [2019-11-28 20:36:26,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:36:26,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:26,870 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-11-28 20:36:26,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:26,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614929795] [2019-11-28 20:36:26,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:26,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614929795] [2019-11-28 20:36:26,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:36:26,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:36:26,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273957025] [2019-11-28 20:36:26,881 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:36:26,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:36:26,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:36:26,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:36:26,886 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 20:36:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:36:26,903 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-11-28 20:36:26,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:36:26,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-11-28 20:36:26,906 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:36:26,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-11-28 20:36:26,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:36:26,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:36:26,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:36:26,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:36:26,907 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:36:26,907 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:36:26,907 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:36:26,907 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:36:26,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:36:26,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:36:26,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:36:26,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:36:26 BoogieIcfgContainer [2019-11-28 20:36:26,915 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:36:26,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:36:26,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:36:26,916 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:36:26,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:23" (3/4) ... [2019-11-28 20:36:26,920 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:36:26,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:36:26,923 INFO L168 Benchmark]: Toolchain (without parser) took 4340.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -198.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:26,924 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:26,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:26,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.43 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.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:26,926 INFO L168 Benchmark]: Boogie Preprocessor took 30.85 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:26,928 INFO L168 Benchmark]: RCFGBuilder took 433.88 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:26,929 INFO L168 Benchmark]: BuchiAutomizer took 3167.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -50.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:26,929 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:26,934 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.43 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.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.85 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 433.88 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3167.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -50.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * s and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 35 SDslu, 20 SDs, 0 SdLazy, 19 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax100 hnf98 lsp96 ukn76 mio100 lsp43 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...