./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrncat_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-15/cstrncat_mixed_alloca_true-termination.c.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 e5f2fff70da48a026b1d6e0ec73c6a0ad6755ace .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:03:54,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:03:54,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:03:54,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:03:54,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:03:54,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:03:54,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:03:54,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:03:54,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:03:54,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:03:54,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:03:54,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:03:54,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:03:54,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:03:54,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:03:54,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:03:54,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:03:54,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:03:54,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:03:54,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:03:54,725 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:03:54,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:03:54,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:03:54,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:03:54,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:03:54,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:03:54,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:03:54,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:03:54,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:03:54,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:03:54,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:03:54,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:03:54,736 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:03:54,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:03:54,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:03:54,740 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:03:54,741 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:03:54,776 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:03:54,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:03:54,777 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:03:54,778 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:03:54,779 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:03:54,779 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:03:54,779 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:03:54,779 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:03:54,779 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:03:54,780 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:03:54,780 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:03:54,780 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:03:54,780 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:03:54,780 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:03:54,780 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:03:54,783 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:03:54,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:03:54,783 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:03:54,783 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:03:54,783 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:03:54,784 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:03:54,784 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:03:54,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:03:54,784 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:03:54,784 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:03:54,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:03:54,785 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:03:54,785 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:03:54,791 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:03:54,792 INFO L133 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 -> e5f2fff70da48a026b1d6e0ec73c6a0ad6755ace [2019-01-01 22:03:54,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:03:54,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:03:54,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:03:54,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:03:54,864 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:03:54,865 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncat_mixed_alloca_true-termination.c.i [2019-01-01 22:03:54,927 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7be1951/e12f95e4a4c74c49b8bac8dbb9ec8328/FLAG3d95847de [2019-01-01 22:03:55,438 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:03:55,438 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncat_mixed_alloca_true-termination.c.i [2019-01-01 22:03:55,453 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7be1951/e12f95e4a4c74c49b8bac8dbb9ec8328/FLAG3d95847de [2019-01-01 22:03:55,736 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7be1951/e12f95e4a4c74c49b8bac8dbb9ec8328 [2019-01-01 22:03:55,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:03:55,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:03:55,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:03:55,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:03:55,746 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:03:55,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:03:55" (1/1) ... [2019-01-01 22:03:55,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fa1603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:55, skipping insertion in model container [2019-01-01 22:03:55,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:03:55" (1/1) ... [2019-01-01 22:03:55,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:03:55,822 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:03:56,249 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:03:56,264 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:03:56,358 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:03:56,518 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:03:56,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56 WrapperNode [2019-01-01 22:03:56,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:03:56,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:03:56,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:03:56,520 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:03:56,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (1/1) ... [2019-01-01 22:03:56,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (1/1) ... [2019-01-01 22:03:56,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:03:56,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:03:56,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:03:56,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:03:56,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (1/1) ... [2019-01-01 22:03:56,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (1/1) ... [2019-01-01 22:03:56,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (1/1) ... [2019-01-01 22:03:56,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (1/1) ... [2019-01-01 22:03:56,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (1/1) ... [2019-01-01 22:03:56,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (1/1) ... [2019-01-01 22:03:56,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (1/1) ... [2019-01-01 22:03:56,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:03:56,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:03:56,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:03:56,603 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:03:56,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (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-01-01 22:03:56,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:03:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:03:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:03:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:03:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:03:56,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:03:57,153 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:03:57,154 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 22:03:57,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:57 BoogieIcfgContainer [2019-01-01 22:03:57,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:03:57,155 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:03:57,155 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:03:57,158 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:03:57,159 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:57,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:03:55" (1/3) ... [2019-01-01 22:03:57,161 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cb7fd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:03:57, skipping insertion in model container [2019-01-01 22:03:57,161 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:57,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:56" (2/3) ... [2019-01-01 22:03:57,161 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cb7fd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:03:57, skipping insertion in model container [2019-01-01 22:03:57,161 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:57,162 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:57" (3/3) ... [2019-01-01 22:03:57,164 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat_mixed_alloca_true-termination.c.i [2019-01-01 22:03:57,224 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:03:57,225 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:03:57,225 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:03:57,225 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:03:57,225 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:03:57,225 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:03:57,226 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:03:57,226 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:03:57,226 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:03:57,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:03:57,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 22:03:57,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:57,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:57,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:03:57,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:03:57,276 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:03:57,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:03:57,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 22:03:57,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:57,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:57,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:03:57,280 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:03:57,287 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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); 6#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(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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-01-01 22:03:57,287 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 !!(0 != 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-01-01 22:03:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-01-01 22:03:57,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:57,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:57,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:57,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:57,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:57,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:57,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-01-01 22:03:57,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:57,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:57,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-01-01 22:03:57,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:57,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:57,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:58,951 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-01-01 22:03:59,129 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-01 22:03:59,156 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:03:59,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:03:59,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:03:59,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:03:59,158 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:03:59,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:03:59,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:03:59,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:03:59,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_mixed_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:03:59,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:03:59,159 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:03:59,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,783 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-01-01 22:03:59,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:59,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:00,301 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 22:04:00,892 WARN L181 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 22:04:01,078 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 22:04:01,143 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:04:01,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:04:01,152 INFO L122 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-01-01 22:04:01,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:01,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,162 INFO L122 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-01-01 22:04:01,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:01,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:01,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,173 INFO L122 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-01-01 22:04:01,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:01,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,180 INFO L122 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-01-01 22:04:01,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:01,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,185 INFO L122 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-01-01 22:04:01,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:01,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,190 INFO L122 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-01-01 22:04:01,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:01,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,195 INFO L122 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-01-01 22:04:01,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:01,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,201 INFO L122 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-01-01 22:04:01,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:01,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,206 INFO L122 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-01-01 22:04:01,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:01,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:01,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,215 INFO L122 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-01-01 22:04:01,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:01,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,221 INFO L122 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-01-01 22:04:01,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:01,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,226 INFO L122 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-01-01 22:04:01,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,227 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:04:01,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,239 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:04:01,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:01,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,300 INFO L122 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-01-01 22:04:01,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:01,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:01,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,313 INFO L122 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-01-01 22:04:01,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:01,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,314 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:04:01,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,315 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:04:01,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:01,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,329 INFO L122 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-01-01 22:04:01,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:01,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:01,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,341 INFO L122 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-01-01 22:04:01,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:01,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:01,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,355 INFO L122 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-01-01 22:04:01,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:01,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:01,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,385 INFO L122 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-01-01 22:04:01,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:01,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:01,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:01,393 INFO L122 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-01-01 22:04:01,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:01,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:01,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:01,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:01,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:01,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:01,465 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:04:01,521 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:04:01,521 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:04:01,524 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:04:01,528 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:04:01,528 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:04:01,529 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1) = -1*ULTIMATE.start_cstrncat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1 Supporting invariants [] [2019-01-01 22:04:01,628 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-01-01 22:04:01,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:04:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:01,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:01,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:01,800 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-01-01 22:04:01,801 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-01-01 22:04:01,943 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-01-01 22:04:01,945 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-01-01 22:04:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:04:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2019-01-01 22:04:01,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 22:04:01,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:01,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 22:04:01,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:01,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 22:04:01,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:01,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 73 transitions. [2019-01-01 22:04:01,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:04:01,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 20 states and 27 transitions. [2019-01-01 22:04:01,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:04:01,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:04:01,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-01-01 22:04:01,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:04:01,962 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-01 22:04:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-01-01 22:04:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-01 22:04:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 22:04:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-01 22:04:01,988 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-01 22:04:01,988 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-01 22:04:01,988 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:04:01,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-01-01 22:04:01,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:04:01,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:01,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:01,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:04:01,991 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:04:01,991 INFO L794 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~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; 158#L381 assume !(main_~length1~0 < 1); 163#L381-2 assume !(main_~length2~0 < 1); 173#L384-1 assume !(main_~n~0 < 1); 168#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(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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; 169#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 159#L367-1 assume !(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 160#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 175#L369 assume !cstrncat_#t~short209; 171#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;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; 174#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 165#L369 [2019-01-01 22:04:01,992 INFO L796 eck$LassoCheckResult]: Loop: 165#L369 assume !cstrncat_#t~short209; 170#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;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; 164#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 165#L369 [2019-01-01 22:04:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:01,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-01-01 22:04:01,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:01,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:01,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:01,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:01,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:04:02,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:04:02,084 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:04:02,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:02,085 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-01-01 22:04:02,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:02,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:02,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:02,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:04:02,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:04:02,142 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:04:02,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:04:02,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:04:02,148 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 22:04:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:04:02,213 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-01-01 22:04:02,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:04:02,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-01-01 22:04:02,216 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:04:02,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-01 22:04:02,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:04:02,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:04:02,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:04:02,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:04:02,217 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:02,217 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:02,217 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:02,217 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:04:02,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:04:02,217 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:04:02,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:04:02,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:04:02 BoogieIcfgContainer [2019-01-01 22:04:02,225 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:04:02,226 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:04:02,226 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:04:02,226 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:04:02,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:57" (3/4) ... [2019-01-01 22:04:02,231 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:04:02,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:04:02,234 INFO L168 Benchmark]: Toolchain (without parser) took 6494.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:02,236 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:02,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:02,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:02,239 INFO L168 Benchmark]: Boogie Preprocessor took 30.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:02,239 INFO L168 Benchmark]: RCFGBuilder took 551.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:02,240 INFO L168 Benchmark]: BuchiAutomizer took 5070.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:02,242 INFO L168 Benchmark]: Witness Printer took 5.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:02,249 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 777.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 551.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5070.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 -1 * s + unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] 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 5.0s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.1s. 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.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital207 mio100 ax100 hnf99 lsp97 ukn77 mio100 lsp51 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf181 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 73ms VariablesStem: 10 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...