./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 79c8f3e75568b724086e7997d923ad8ab07e6657 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:06:53,946 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:06:53,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:06:53,955 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:06:53,955 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:06:53,955 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:06:53,956 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:06:53,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:06:53,958 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:06:53,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:06:53,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:06:53,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:06:53,960 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:06:53,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:06:53,962 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:06:53,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:06:53,963 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:06:53,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:06:53,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:06:53,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:06:53,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:06:53,968 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:06:53,970 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:06:53,970 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:06:53,970 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:06:53,971 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:06:53,972 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:06:53,972 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:06:53,973 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:06:53,973 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:06:53,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:06:53,974 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:06:53,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:06:53,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:06:53,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:06:53,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:06:53,975 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:06:53,985 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:06:53,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:06:53,986 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:06:53,987 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:06:53,987 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:06:53,987 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:06:53,987 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:06:53,987 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:06:53,987 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:06:53,987 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:06:53,988 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:06:53,988 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:06:53,988 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:06:53,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:06:53,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:06:53,988 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:06:53,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:06:53,988 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:06:53,988 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:06:53,989 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:06:53,989 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:06:53,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:06:53,989 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:06:53,989 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:06:53,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:06:53,989 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:06:53,989 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:06:53,990 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:06:53,990 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79c8f3e75568b724086e7997d923ad8ab07e6657 [2018-11-10 07:06:54,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:06:54,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:06:54,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:06:54,022 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:06:54,022 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:06:54,023 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i [2018-11-10 07:06:54,058 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/data/2ac9c84bf/5c46456a221340c98cfb542996a24fa5/FLAGa9ea2a0d7 [2018-11-10 07:06:54,483 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:06:54,483 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/sv-benchmarks/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i [2018-11-10 07:06:54,489 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/data/2ac9c84bf/5c46456a221340c98cfb542996a24fa5/FLAGa9ea2a0d7 [2018-11-10 07:06:54,497 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/data/2ac9c84bf/5c46456a221340c98cfb542996a24fa5 [2018-11-10 07:06:54,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:06:54,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:06:54,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:06:54,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:06:54,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:06:54,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6346d868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54, skipping insertion in model container [2018-11-10 07:06:54,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:06:54,534 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:06:54,723 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:06:54,730 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:06:54,762 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:06:54,805 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:06:54,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54 WrapperNode [2018-11-10 07:06:54,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:06:54,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:06:54,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:06:54,807 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:06:54,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:06:54,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:06:54,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:06:54,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:06:54,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... [2018-11-10 07:06:54,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:06:54,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:06:54,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:06:54,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:06:54,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_31c7c2b0-4015-4f37-b20a-975583e87af8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:06:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:06:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:06:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:06:54,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:06:55,142 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:06:55,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:06:55 BoogieIcfgContainer [2018-11-10 07:06:55,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:06:55,143 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:06:55,143 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:06:55,146 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:06:55,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:06:55,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:06:54" (1/3) ... [2018-11-10 07:06:55,148 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@798b2fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:06:55, skipping insertion in model container [2018-11-10 07:06:55,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:06:55,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:54" (2/3) ... [2018-11-10 07:06:55,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@798b2fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:06:55, skipping insertion in model container [2018-11-10 07:06:55,149 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:06:55,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:06:55" (3/3) ... [2018-11-10 07:06:55,151 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcat_reverse_alloca_true-termination.c.i [2018-11-10 07:06:55,203 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:06:55,203 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:06:55,203 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:06:55,204 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:06:55,204 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:06:55,204 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:06:55,204 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:06:55,204 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:06:55,204 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:06:55,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 07:06:55,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 07:06:55,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:06:55,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:06:55,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:06:55,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 07:06:55,235 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:06:55,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 07:06:55,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 07:06:55,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:06:55,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:06:55,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:06:55,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 07:06:55,244 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet210, main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet210;havoc main_#t~nondet210;main_~length2~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~length3~0 := main_#t~nondet212;havoc main_#t~nondet212; 4#L377true assume !(main_~length1~0 < 1); 8#L377-2true assume !(main_~length2~0 < 2); 20#L380-1true assume !(main_~length3~0 < 1); 14#L383-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 23#L389true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L389 3#L389-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - main_~length3~0) * 1, 1); srcloc: L389-1 19#L390true main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset, cstrcat_#t~mem205, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, cstrcat_#t~post208.base, cstrcat_#t~post208.offset, cstrcat_#t~mem209, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 10#L367-4true [2018-11-10 07:06:55,245 INFO L795 eck$LassoCheckResult]: Loop: 10#L367-4true assume true; 5#L367-1true SUMMARY for call cstrcat_#t~mem205 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L367-1 7#L367-2true assume !!(cstrcat_#t~mem205 != 0);havoc cstrcat_#t~mem205;cstrcat_#t~post206.base, cstrcat_#t~post206.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post206.base, cstrcat_#t~post206.offset - 1;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset; 10#L367-4true [2018-11-10 07:06:55,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:55,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-11-10 07:06:55,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:06:55,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:06:55,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:55,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:06:55,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:55,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:55,367 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-10 07:06:55,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:06:55,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:06:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:55,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:06:55,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:55,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:55,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-11-10 07:06:55,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:06:55,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:06:55,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:55,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:06:55,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:55,735 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-11-10 07:06:55,849 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:06:55,850 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:06:55,850 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:06:55,850 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:06:55,850 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:06:55,850 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:06:55,850 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:06:55,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:06:55,851 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_reverse_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 07:06:55,851 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:06:55,851 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:06:55,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:55,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:55,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:55,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:55,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:55,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,109 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-10 07:06:56,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:56,597 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:06:56,600 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:06:56,602 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 [2018-11-10 07:06:56,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:56,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:56,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:56,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,608 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 [2018-11-10 07:06:56,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:56,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:56,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,614 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 [2018-11-10 07:06:56,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:56,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:56,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:56,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,619 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 [2018-11-10 07:06:56,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:56,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:56,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:56,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,621 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 [2018-11-10 07:06:56,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:56,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:56,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,629 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 [2018-11-10 07:06:56,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:56,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:56,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,635 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 [2018-11-10 07:06:56,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:56,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:56,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,644 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 [2018-11-10 07:06:56,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:56,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:56,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,649 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 [2018-11-10 07:06:56,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:56,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:56,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,653 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 [2018-11-10 07:06:56,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:56,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,654 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:06:56,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,655 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:06:56,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:56,657 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,658 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 [2018-11-10 07:06:56,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:56,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:56,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:56,671 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 [2018-11-10 07:06:56,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:56,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:56,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:56,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:56,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:56,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:56,727 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:06:56,742 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:06:56,742 INFO L444 ModelExtractionUtils]: 61 out of 64 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:06:56,744 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:06:56,745 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:06:56,746 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:06:56,746 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s~0.offset) = 2*ULTIMATE.start_cstrcat_~s~0.offset + 1 Supporting invariants [] [2018-11-10 07:06:56,782 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-11-10 07:06:56,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:56,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:06:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:56,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:06:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:56,860 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 [2018-11-10 07:06:56,861 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-11-10 07:06:56,890 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 54 states and 65 transitions. Complement of second has 7 states. [2018-11-10 07:06:56,891 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 [2018-11-10 07:06:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:06:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-10 07:06:56,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 07:06:56,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:06:56,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 07:06:56,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:06:56,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 07:06:56,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:06:56,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-11-10 07:06:56,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:06:56,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 22 states and 26 transitions. [2018-11-10 07:06:56,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 07:06:56,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 07:06:56,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-10 07:06:56,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:06:56,900 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 07:06:56,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-10 07:06:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-10 07:06:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 07:06:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-11-10 07:06:56,917 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 07:06:56,917 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 07:06:56,917 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:06:56,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-11-10 07:06:56,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:06:56,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:06:56,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:06:56,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:06:56,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:06:56,918 INFO L793 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet210, main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet210;havoc main_#t~nondet210;main_~length2~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~length3~0 := main_#t~nondet212;havoc main_#t~nondet212; 189#L377 assume !(main_~length1~0 < 1); 190#L377-2 assume !(main_~length2~0 < 2); 196#L380-1 assume !(main_~length3~0 < 1); 200#L383-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 201#L389 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L389 187#L389-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - main_~length3~0) * 1, 1); srcloc: L389-1 188#L390 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset, cstrcat_#t~mem205, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, cstrcat_#t~post208.base, cstrcat_#t~post208.offset, cstrcat_#t~mem209, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 198#L367-4 assume true; 193#L367-1 SUMMARY for call cstrcat_#t~mem205 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L367-1 194#L367-2 assume !(cstrcat_#t~mem205 != 0);havoc cstrcat_#t~mem205; 192#L369-5 [2018-11-10 07:06:56,919 INFO L795 eck$LassoCheckResult]: Loop: 192#L369-5 assume true; 197#L369 cstrcat_#t~post207.base, cstrcat_#t~post207.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post207.base, cstrcat_#t~post207.offset - 1;cstrcat_#t~post208.base, cstrcat_#t~post208.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post208.base, cstrcat_#t~post208.offset - 1; 203#L369-1 SUMMARY for call cstrcat_#t~mem209 := read~int(cstrcat_#t~post208.base, cstrcat_#t~post208.offset, 1); srcloc: L369-1 204#L369-2 SUMMARY for call write~int(cstrcat_#t~mem209, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, 1); srcloc: L369-2 191#L369-3 assume !!(cstrcat_#t~mem209 != 0);havoc cstrcat_#t~mem209;havoc cstrcat_#t~post207.base, cstrcat_#t~post207.offset;havoc cstrcat_#t~post208.base, cstrcat_#t~post208.offset; 192#L369-5 [2018-11-10 07:06:56,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:56,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535319, now seen corresponding path program 1 times [2018-11-10 07:06:56,919 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:06:56,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:06:56,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:56,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:06:56,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:56,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:56,941 INFO L82 PathProgramCache]: Analyzing trace with hash 71635474, now seen corresponding path program 1 times [2018-11-10 07:06:56,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:06:56,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:06:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:56,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:06:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:56,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1206755708, now seen corresponding path program 1 times [2018-11-10 07:06:56,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:06:56,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:06:56,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:56,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:06:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:57,300 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 112 [2018-11-10 07:06:57,384 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:06:57,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:06:57,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:06:57,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:06:57,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:06:57,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:06:57,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:06:57,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:06:57,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 07:06:57,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:06:57,385 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:06:57,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,646 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2018-11-10 07:06:57,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:57,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:58,202 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:06:58,202 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:06:58,203 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 [2018-11-10 07:06:58,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:58,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:58,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:58,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,205 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 [2018-11-10 07:06:58,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:58,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:58,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:58,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,207 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 [2018-11-10 07:06:58,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:58,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:58,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:58,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,209 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 [2018-11-10 07:06:58,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:58,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:58,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:58,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,210 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 [2018-11-10 07:06:58,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:58,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:58,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:58,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,212 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 [2018-11-10 07:06:58,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:58,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,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 [2018-11-10 07:06:58,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:58,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:58,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:58,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,216 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 [2018-11-10 07:06:58,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:58,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:58,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:58,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,218 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 [2018-11-10 07:06:58,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:58,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:58,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:58,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,220 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 [2018-11-10 07:06:58,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:58,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,223 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 [2018-11-10 07:06:58,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:58,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,227 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 [2018-11-10 07:06:58,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:06:58,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,229 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:06:58,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,234 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 [2018-11-10 07:06:58,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:58,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,238 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 [2018-11-10 07:06:58,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:58,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,241 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 [2018-11-10 07:06:58,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:58,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,249 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 [2018-11-10 07:06:58,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,249 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:06:58,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,251 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:06:58,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,258 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 [2018-11-10 07:06:58,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:58,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,264 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 [2018-11-10 07:06:58,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:58,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,267 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 [2018-11-10 07:06:58,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:58,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,268 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:06:58,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,268 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:06:58,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:58,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:58,270 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 [2018-11-10 07:06:58,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:58,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:58,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:58,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:58,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:58,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:58,303 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:06:58,329 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:06:58,330 INFO L444 ModelExtractionUtils]: 64 out of 70 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 07:06:58,330 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:06:58,331 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:06:58,331 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:06:58,331 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 + 2*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2018-11-10 07:06:58,383 INFO L297 tatePredicateManager]: 17 out of 19 supporting invariants were superfluous and have been removed [2018-11-10 07:06:58,385 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:06:58,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:58,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:06:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:58,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:06:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:58,499 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2018-11-10 07:06:58,499 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-10 07:06:58,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 24 states and 29 transitions. Complement of second has 10 states. [2018-11-10 07:06:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 07:06:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 07:06:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-10 07:06:58,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 07:06:58,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:06:58,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 07:06:58,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:06:58,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 07:06:58,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:06:58,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-10 07:06:58,579 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:06:58,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-10 07:06:58,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:06:58,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:06:58,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:06:58,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:06:58,580 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:06:58,580 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:06:58,580 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:06:58,580 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:06:58,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:06:58,580 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:06:58,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:06:58,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:06:58 BoogieIcfgContainer [2018-11-10 07:06:58,585 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:06:58,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:06:58,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:06:58,585 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:06:58,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:06:55" (3/4) ... [2018-11-10 07:06:58,588 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:06:58,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:06:58,589 INFO L168 Benchmark]: Toolchain (without parser) took 4089.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 149.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:58,590 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:06:58,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.33 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:58,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -215.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:58,591 INFO L168 Benchmark]: Boogie Preprocessor took 17.99 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. [2018-11-10 07:06:58,591 INFO L168 Benchmark]: RCFGBuilder took 249.68 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:58,591 INFO L168 Benchmark]: BuchiAutomizer took 3441.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.2 MB). Peak memory consumption was 161.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:58,592 INFO L168 Benchmark]: Witness Printer took 3.50 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:06:58,594 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.33 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -215.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 249.68 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3441.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.2 MB). Peak memory consumption was 161.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.50 ms. Allocated memory is still 1.4 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 (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * s + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + 2 * s and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 53 SDslu, 40 SDs, 0 SdLazy, 20 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax100 hnf99 lsp97 ukn107 mio100 lsp49 div100 bol100 ite100 ukn100 eq198 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...