./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcat_short_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcat_short_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/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 2cfe214f4978682dac68f5565e20ebc7c152d196 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:26:18,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:26:18,705 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:26:18,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:26:18,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:26:18,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:26:18,714 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:26:18,715 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:26:18,716 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:26:18,717 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:26:18,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:26:18,718 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:26:18,719 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:26:18,719 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:26:18,720 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:26:18,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:26:18,721 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:26:18,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:26:18,723 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:26:18,725 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:26:18,725 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:26:18,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:26:18,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:26:18,728 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:26:18,728 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:26:18,729 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:26:18,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:26:18,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:26:18,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:26:18,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:26:18,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:26:18,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:26:18,732 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:26:18,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:26:18,733 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:26:18,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:26:18,733 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 09:26:18,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:26:18,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:26:18,745 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:26:18,745 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:26:18,746 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:26:18,746 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:26:18,746 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:26:18,746 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:26:18,746 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:26:18,746 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:26:18,746 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:26:18,747 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:26:18,747 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:26:18,747 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:26:18,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:26:18,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:26:18,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:26:18,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:26:18,747 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:26:18,748 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:26:18,748 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:26:18,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:26:18,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:26:18,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:26:18,748 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:26:18,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:26:18,749 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:26:18,749 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:26:18,749 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:26:18,749 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_dfc34e15-ee93-4822-b321-2481f30299b4/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 -> 2cfe214f4978682dac68f5565e20ebc7c152d196 [2018-11-18 09:26:18,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:26:18,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:26:18,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:26:18,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:26:18,783 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:26:18,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcat_short_true-termination.c.i [2018-11-18 09:26:18,823 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/data/210a29400/83893d3b887b4e5e94a00f99a3e78fe9/FLAG43d096bd2 [2018-11-18 09:26:19,251 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:26:19,252 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/sv-benchmarks/c/termination-libowfat/strcat_short_true-termination.c.i [2018-11-18 09:26:19,262 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/data/210a29400/83893d3b887b4e5e94a00f99a3e78fe9/FLAG43d096bd2 [2018-11-18 09:26:19,273 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/bin-2019/uautomizer/data/210a29400/83893d3b887b4e5e94a00f99a3e78fe9 [2018-11-18 09:26:19,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:26:19,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:26:19,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:26:19,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:26:19,280 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:26:19,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7764f50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19, skipping insertion in model container [2018-11-18 09:26:19,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:26:19,319 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:26:19,517 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:26:19,524 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:26:19,553 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:26:19,622 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:26:19,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19 WrapperNode [2018-11-18 09:26:19,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:26:19,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:26:19,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:26:19,623 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:26:19,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:26:19,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:26:19,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:26:19,652 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:26:19,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... [2018-11-18 09:26:19,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:26:19,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:26:19,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:26:19,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:26:19,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfc34e15-ee93-4822-b321-2481f30299b4/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-18 09:26:19,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:26:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:26:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:26:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:26:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:26:19,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:26:19,856 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:26:19,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:26:19 BoogieIcfgContainer [2018-11-18 09:26:19,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:26:19,857 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:26:19,857 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:26:19,860 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:26:19,861 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:26:19,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:26:19" (1/3) ... [2018-11-18 09:26:19,862 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ac6478b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:26:19, skipping insertion in model container [2018-11-18 09:26:19,862 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:26:19,862 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:26:19" (2/3) ... [2018-11-18 09:26:19,862 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ac6478b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:26:19, skipping insertion in model container [2018-11-18 09:26:19,862 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:26:19,862 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:26:19" (3/3) ... [2018-11-18 09:26:19,864 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcat_short_true-termination.c.i [2018-11-18 09:26:19,901 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:26:19,902 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:26:19,902 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:26:19,902 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:26:19,902 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:26:19,902 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:26:19,902 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:26:19,902 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:26:19,902 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:26:19,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 09:26:19,925 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:26:19,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:26:19,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:26:19,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:26:19,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:26:19,931 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:26:19,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 09:26:19,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:26:19,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:26:19,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:26:19,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:26:19,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:26:19,940 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 7#L523true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 21#L527true assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 17#L529true assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);assume { :begin_inline_strcat } true;strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 15#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3#L509-4true [2018-11-18 09:26:19,940 INFO L796 eck$LassoCheckResult]: Loop: 3#L509-4true assume true;call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 16#L509-1true assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 20#L509-3true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3#L509-4true [2018-11-18 09:26:19,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-11-18 09:26:19,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:26:19,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:26:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:19,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:26:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:20,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2018-11-18 09:26:20,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:26:20,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:26:20,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:20,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:26:20,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:20,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:20,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2018-11-18 09:26:20,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:26:20,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:26:20,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:20,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:26:20,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:20,440 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-11-18 09:26:20,540 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:26:20,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:26:20,541 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:26:20,541 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:26:20,541 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:26:20,541 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:26:20,541 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:26:20,541 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:26:20,541 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short_true-termination.c.i_Iteration1_Lasso [2018-11-18 09:26:20,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:26:20,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:26:20,559 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-18 09:26:20,563 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-18 09:26:20,575 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-18 09:26:20,577 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-18 09:26:20,579 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-18 09:26:20,581 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-18 09:26:20,583 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-18 09:26:20,584 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-18 09:26:20,587 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-18 09:26:20,589 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-18 09:26:20,591 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-18 09:26:20,599 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-18 09:26:20,786 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-18 09:26:20,815 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-18 09:26:20,816 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-18 09:26:20,817 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-18 09:26:20,818 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-18 09:26:20,819 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-18 09:26:20,820 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-18 09:26:20,821 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-18 09:26:20,823 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-18 09:26:20,824 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-18 09:26:20,827 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-18 09:26:20,828 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-18 09:26:21,141 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:26:21,145 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:26:21,146 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-18 09:26:21,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:21,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:21,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:21,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:26:21,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:21,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:21,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:21,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,155 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-18 09:26:21,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:21,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:21,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:21,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,157 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-18 09:26:21,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:21,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,164 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-18 09:26:21,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:21,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:21,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:21,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,167 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-18 09:26:21,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:21,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:21,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:21,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,169 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-18 09:26:21,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:21,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:21,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:21,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,172 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-18 09:26:21,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:21,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,187 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-18 09:26:21,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:21,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:21,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:21,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,191 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-18 09:26:21,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:21,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:21,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:21,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,194 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-18 09:26:21,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:21,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:26:21,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:21,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,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-18 09:26:21,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:21,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,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-18 09:26:21,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:21,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:26:21,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:26:21,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,229 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:26:21,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,248 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-18 09:26:21,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:21,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,255 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-18 09:26:21,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:21,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,256 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:26:21,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,256 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:26:21,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:21,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,261 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-18 09:26:21,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,262 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:26:21,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,264 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:26:21,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:21,273 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-18 09:26:21,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:21,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:21,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:21,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:21,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:21,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:21,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:26:21,328 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 09:26:21,329 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:26:21,331 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:26:21,332 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:26:21,333 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:26:21,333 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2018-11-18 09:26:21,365 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 09:26:21,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:26:21,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:26:21,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:26:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:26:21,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:26:21,458 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-18 09:26:21,469 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 09:26:21,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 5 states. [2018-11-18 09:26:21,529 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 5 states. Result 49 states and 64 transitions. Complement of second has 8 states. [2018-11-18 09:26:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 09:26:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:26:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-18 09:26:21,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 09:26:21,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:26:21,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 09:26:21,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:26:21,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-18 09:26:21,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:26:21,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2018-11-18 09:26:21,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:26:21,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 20 states and 23 transitions. [2018-11-18 09:26:21,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 09:26:21,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 09:26:21,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-18 09:26:21,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:26:21,538 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-18 09:26:21,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-18 09:26:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-11-18 09:26:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 09:26:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-18 09:26:21,554 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 09:26:21,554 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 09:26:21,554 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:26:21,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-18 09:26:21,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:26:21,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:26:21,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:26:21,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:26:21,556 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:26:21,556 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 176#L523 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 177#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 182#L529 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);assume { :begin_inline_strcat } true;strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 181#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 174#L510 strcat_#t~ret5 := strlen_#res;assume { :end_inline_strlen } true;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 175#L516-3 [2018-11-18 09:26:21,556 INFO L796 eck$LassoCheckResult]: Loop: 175#L516-3 assume true; 171#L516-1 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 172#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 175#L516-3 [2018-11-18 09:26:21,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2018-11-18 09:26:21,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:26:21,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:26:21,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:26:21,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:26:21,599 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-18 09:26:21,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:26:21,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:26:21,602 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:26:21,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:21,602 INFO L82 PathProgramCache]: Analyzing trace with hash 72655, now seen corresponding path program 1 times [2018-11-18 09:26:21,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:26:21,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:26:21,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:26:21,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:26:21,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:26:21,658 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 09:26:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:26:21,684 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-18 09:26:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:26:21,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2018-11-18 09:26:21,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:26:21,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2018-11-18 09:26:21,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 09:26:21,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 09:26:21,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-18 09:26:21,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:26:21,687 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-18 09:26:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-18 09:26:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 09:26:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 09:26:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-18 09:26:21,688 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-18 09:26:21,688 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-18 09:26:21,691 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:26:21,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-18 09:26:21,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:26:21,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:26:21,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:26:21,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:26:21,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:26:21,692 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 217#L523 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 218#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 223#L529 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);assume { :begin_inline_strcat } true;strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 221#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 208#L509-4 assume true;call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 210#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 214#L509-5 strlen_#res := strlen_~i~0; 215#L510 strcat_#t~ret5 := strlen_#res;assume { :end_inline_strlen } true;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 216#L516-3 [2018-11-18 09:26:21,692 INFO L796 eck$LassoCheckResult]: Loop: 216#L516-3 assume true; 212#L516-1 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 213#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 216#L516-3 [2018-11-18 09:26:21,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2018-11-18 09:26:21,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:26:21,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:26:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:26:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:21,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash 72655, now seen corresponding path program 2 times [2018-11-18 09:26:21,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:26:21,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:26:21,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:26:21,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:21,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash -808266370, now seen corresponding path program 1 times [2018-11-18 09:26:21,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:26:21,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:26:21,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:26:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:26:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:26:22,070 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 117 [2018-11-18 09:26:22,177 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-18 09:26:22,179 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:26:22,179 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:26:22,179 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:26:22,179 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:26:22,179 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:26:22,179 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:26:22,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:26:22,179 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:26:22,180 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short_true-termination.c.i_Iteration3_Lasso [2018-11-18 09:26:22,180 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:26:22,180 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:26:22,182 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-18 09:26:22,187 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-18 09:26:22,188 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-18 09:26:22,189 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-18 09:26:22,190 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-18 09:26:22,191 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-18 09:26:22,192 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-18 09:26:22,193 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-18 09:26:22,194 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-18 09:26:22,195 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-18 09:26:22,195 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-18 09:26:22,196 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-18 09:26:22,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-18 09:26:22,432 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2018-11-18 09:26:22,507 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-18 09:26:22,508 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-18 09:26:22,509 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-18 09:26:22,510 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-18 09:26:22,511 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-18 09:26:22,512 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-18 09:26:22,513 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-18 09:26:22,513 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-18 09:26:22,860 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:26:22,861 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:26:22,861 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-18 09:26:22,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,863 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-18 09:26:22,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,865 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-18 09:26:22,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,867 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-18 09:26:22,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,869 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-18 09:26:22,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,870 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-18 09:26:22,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:22,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:22,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,873 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-18 09:26:22,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,875 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-18 09:26:22,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,877 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-18 09:26:22,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,879 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-18 09:26:22,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,880 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-18 09:26:22,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:26:22,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:26:22,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:26:22,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,882 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-18 09:26:22,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:22,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:22,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,885 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-18 09:26:22,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:22,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:22,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,891 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-18 09:26:22,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:22,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:22,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:26:22,897 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-18 09:26:22,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:26:22,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:26:22,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:26:22,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:26:22,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:26:22,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:26:22,922 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:26:22,946 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 09:26:22,946 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 09:26:22,946 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:26:22,947 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:26:22,948 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:26:22,948 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2, ULTIMATE.start_strcat_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 - 1*ULTIMATE.start_strcat_~s.offset Supporting invariants [] [2018-11-18 09:26:23,000 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-11-18 09:26:23,002 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:26:23,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:26:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:26:23,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:26:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:26:23,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:26:23,077 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-18 09:26:23,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 09:26:23,078 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-18 09:26:23,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 19 states and 22 transitions. Complement of second has 8 states. [2018-11-18 09:26:23,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:26:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:26:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-11-18 09:26:23,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-18 09:26:23,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:26:23,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-18 09:26:23,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:26:23,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-18 09:26:23,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:26:23,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-11-18 09:26:23,126 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:26:23,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-18 09:26:23,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:26:23,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:26:23,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:26:23,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:26:23,126 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:26:23,126 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:26:23,127 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:26:23,127 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:26:23,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:26:23,127 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:26:23,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:26:23,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:26:23 BoogieIcfgContainer [2018-11-18 09:26:23,132 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:26:23,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:26:23,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:26:23,132 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:26:23,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:26:19" (3/4) ... [2018-11-18 09:26:23,136 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:26:23,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:26:23,136 INFO L168 Benchmark]: Toolchain (without parser) took 3860.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -260.3 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:26:23,137 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:26:23,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:26:23,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.22 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:26:23,138 INFO L168 Benchmark]: Boogie Preprocessor took 15.66 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-18 09:26:23,141 INFO L168 Benchmark]: RCFGBuilder took 188.76 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:26:23,141 INFO L168 Benchmark]: BuchiAutomizer took 3274.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.8 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:26:23,142 INFO L168 Benchmark]: Witness Printer took 3.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:26:23,144 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.22 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.66 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 188.76 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3274.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.8 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 43 SDtfs, 76 SDslu, 27 SDs, 0 SdLazy, 37 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital229 mio100 ax100 hnf99 lsp95 ukn83 mio100 lsp48 div100 bol100 ite100 ukn100 eq190 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 7 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...