./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7360833afd5a8b935377ce87ce4cc4a6584d3d0c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:35:38,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:35:38,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:35:38,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:35:38,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:35:38,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:35:38,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:35:38,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:35:38,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:35:38,750 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:35:38,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:35:38,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:35:38,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:35:38,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:35:38,758 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:35:38,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:35:38,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:35:38,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:35:38,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:35:38,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:35:38,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:35:38,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:35:38,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:35:38,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:35:38,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:35:38,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:35:38,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:35:38,774 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:35:38,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:35:38,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:35:38,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:35:38,779 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:35:38,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:35:38,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:35:38,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:35:38,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:35:38,782 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:35:38,803 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:35:38,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:35:38,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:35:38,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:35:38,808 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:35:38,808 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:35:38,808 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:35:38,808 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:35:38,808 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:35:38,808 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:35:38,809 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:35:38,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:35:38,810 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:35:38,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:35:38,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:35:38,811 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:35:38,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:35:38,811 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:35:38,812 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:35:38,812 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:35:38,812 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:35:38,812 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:35:38,812 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:35:38,812 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:35:38,813 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:35:38,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:35:38,813 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:35:38,813 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:35:38,815 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:35:38,816 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7360833afd5a8b935377ce87ce4cc4a6584d3d0c [2019-01-14 02:35:38,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:35:38,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:35:38,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:35:38,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:35:38,882 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:35:38,883 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i [2019-01-14 02:35:38,949 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8f9d3a22/dd1e326409654031b28e097c9b625159/FLAG23bf244de [2019-01-14 02:35:39,526 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:35:39,529 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i [2019-01-14 02:35:39,544 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8f9d3a22/dd1e326409654031b28e097c9b625159/FLAG23bf244de [2019-01-14 02:35:39,750 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8f9d3a22/dd1e326409654031b28e097c9b625159 [2019-01-14 02:35:39,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:35:39,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:35:39,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:35:39,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:35:39,759 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:35:39,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:35:39" (1/1) ... [2019-01-14 02:35:39,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57fe65e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:39, skipping insertion in model container [2019-01-14 02:35:39,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:35:39" (1/1) ... [2019-01-14 02:35:39,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:35:39,812 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:35:40,221 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:35:40,233 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:35:40,347 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:35:40,397 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:35:40,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40 WrapperNode [2019-01-14 02:35:40,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:35:40,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:35:40,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:35:40,398 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:35:40,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... [2019-01-14 02:35:40,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... [2019-01-14 02:35:40,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:35:40,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:35:40,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:35:40,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:35:40,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... [2019-01-14 02:35:40,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... [2019-01-14 02:35:40,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... [2019-01-14 02:35:40,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... [2019-01-14 02:35:40,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... [2019-01-14 02:35:40,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... [2019-01-14 02:35:40,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... [2019-01-14 02:35:40,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:35:40,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:35:40,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:35:40,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:35:40,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:35:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:35:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:35:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:35:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:35:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:35:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:35:40,957 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:35:40,957 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:35:40,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:35:40 BoogieIcfgContainer [2019-01-14 02:35:40,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:35:40,959 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:35:40,959 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:35:40,963 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:35:40,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:35:40,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:35:39" (1/3) ... [2019-01-14 02:35:40,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63a231f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:35:40, skipping insertion in model container [2019-01-14 02:35:40,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:35:40,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:40" (2/3) ... [2019-01-14 02:35:40,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63a231f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:35:40, skipping insertion in model container [2019-01-14 02:35:40,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:35:40,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:35:40" (3/3) ... [2019-01-14 02:35:40,971 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-termination.c.i [2019-01-14 02:35:41,030 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:35:41,031 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:35:41,031 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:35:41,031 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:35:41,031 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:35:41,032 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:35:41,032 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:35:41,032 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:35:41,032 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:35:41,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-14 02:35:41,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:35:41,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:41,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:41,077 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:35:41,077 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:35:41,077 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:35:41,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-14 02:35:41,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:35:41,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:41,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:41,082 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:35:41,082 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:35:41,092 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13.base, main_#t~ret13.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length2~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~n~0 := main_#t~nondet10;havoc main_#t~nondet10; 4#L568true assume !(main_~length1~0 < 1); 6#L568-2true assume !(main_~length2~0 < 1); 21#L571-1true assume !(main_~n~0 < 1); 13#L574-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~dst.base, cstrncat_#in~dst.offset, cstrncat_#in~src.base, cstrncat_#in~src.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post5.base, cstrncat_#t~post5.offset, cstrncat_#t~mem6, cstrncat_#t~post7.base, cstrncat_#t~post7.offset, cstrncat_#t~pre4, cstrncat_~d~0.base, cstrncat_~d~0.offset, cstrncat_~s~0.base, cstrncat_~s~0.offset, cstrncat_~dst.base, cstrncat_~dst.offset, cstrncat_~src.base, cstrncat_~src.offset, cstrncat_~n;cstrncat_~dst.base, cstrncat_~dst.offset := cstrncat_#in~dst.base, cstrncat_#in~dst.offset;cstrncat_~src.base, cstrncat_~src.offset := cstrncat_#in~src.base, cstrncat_#in~src.offset;cstrncat_~n := cstrncat_#in~n; 18#L550true assume 0 != cstrncat_~n % 4294967296;cstrncat_~d~0.base, cstrncat_~d~0.offset := cstrncat_~dst.base, cstrncat_~dst.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~src.base, cstrncat_~src.offset; 19#L553-3true [2019-01-14 02:35:41,094 INFO L796 eck$LassoCheckResult]: Loop: 19#L553-3true call cstrncat_#t~mem2 := read~int(cstrncat_~d~0.base, cstrncat_~d~0.offset, 1); 12#L553-1true assume !!(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~d~0.base, cstrncat_~d~0.offset;cstrncat_~d~0.base, cstrncat_~d~0.offset := cstrncat_#t~post3.base, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 19#L553-3true [2019-01-14 02:35:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:41,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939629, now seen corresponding path program 1 times [2019-01-14 02:35:41,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:41,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:41,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:41,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-01-14 02:35:41,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:41,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:41,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:41,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:41,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1302196946, now seen corresponding path program 1 times [2019-01-14 02:35:41,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:41,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:41,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:42,648 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2019-01-14 02:35:42,987 WARN L181 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-14 02:35:43,007 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:35:43,009 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:35:43,009 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:35:43,009 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:35:43,009 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:35:43,009 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:35:43,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:35:43,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:35:43,010 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncat-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:35:43,010 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:35:43,010 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:35:43,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:43,651 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-01-14 02:35:44,205 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-14 02:35:45,020 WARN L181 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:35:45,212 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:35:45,217 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:35:45,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:45,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:45,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:45,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:45,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:45,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:45,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:45,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:45,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:45,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:45,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:45,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:45,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:45,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,372 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:35:45,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,389 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:35:45,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:45,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:45,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:45,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:45,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:45,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:45,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:45,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:45,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:45,577 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:35:45,661 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:35:45,663 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:35:45,668 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:35:45,671 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:35:45,673 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:35:45,674 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_cstrncat_~d~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_cstrncat_~d~0.offset Supporting invariants [] [2019-01-14 02:35:45,906 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:35:45,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:35:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:46,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:46,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:35:46,569 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:35:46,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2019-01-14 02:35:46,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 46 states and 61 transitions. Complement of second has 9 states. [2019-01-14 02:35:46,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:35:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:35:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2019-01-14 02:35:46,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:35:46,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:46,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:35:46,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:46,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:35:46,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:46,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2019-01-14 02:35:46,826 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:35:46,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-01-14 02:35:46,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:35:46,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:35:46,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:35:46,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:35:46,830 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:35:46,830 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:35:46,830 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:35:46,830 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:35:46,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:35:46,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:35:46,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:35:46,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:35:46 BoogieIcfgContainer [2019-01-14 02:35:46,836 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:35:46,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:35:46,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:35:46,837 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:35:46,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:35:40" (3/4) ... [2019-01-14 02:35:46,841 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:35:46,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:35:46,842 INFO L168 Benchmark]: Toolchain (without parser) took 7088.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -118.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:46,843 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:46,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:46,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:46,846 INFO L168 Benchmark]: Boogie Preprocessor took 30.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:46,847 INFO L168 Benchmark]: RCFGBuilder took 481.14 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:46,847 INFO L168 Benchmark]: BuchiAutomizer took 5876.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 99.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:46,850 INFO L168 Benchmark]: Witness Printer took 4.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:46,855 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 642.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.85 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. * Boogie Preprocessor took 30.01 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 481.14 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5876.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 99.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * d and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 21 SDslu, 19 SDs, 0 SdLazy, 17 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital215 mio100 ax108 hnf98 lsp89 ukn78 mio100 lsp42 div157 bol100 ite100 ukn100 eq169 hnf72 smp94 dnf219 smp97 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 118ms VariablesStem: 11 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...