./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strcat_short_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-libowfat/strcat_short_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 2cfe214f4978682dac68f5565e20ebc7c152d196 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:17:43,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:17:43,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:17:44,005 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:17:44,006 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:17:44,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:17:44,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:17:44,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:17:44,012 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:17:44,013 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:17:44,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:17:44,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:17:44,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:17:44,016 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:17:44,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:17:44,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:17:44,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:17:44,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:17:44,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:17:44,026 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:17:44,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:17:44,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:17:44,031 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:17:44,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:17:44,032 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:17:44,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:17:44,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:17:44,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:17:44,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:17:44,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:17:44,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:17:44,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:17:44,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:17:44,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:17:44,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:17:44,042 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:17:44,042 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:17:44,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:17:44,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:17:44,062 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:17:44,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:17:44,062 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:17:44,063 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:17:44,063 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:17:44,063 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:17:44,063 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:17:44,063 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:17:44,063 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:17:44,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:17:44,064 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:17:44,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:17:44,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:17:44,064 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:17:44,064 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:17:44,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:17:44,066 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:17:44,066 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:17:44,067 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:17:44,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:17:44,067 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:17:44,067 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:17:44,067 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:17:44,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:17:44,069 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:17:44,069 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:17:44,070 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:17:44,070 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 -> 2cfe214f4978682dac68f5565e20ebc7c152d196 [2018-11-28 23:17:44,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:17:44,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:17:44,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:17:44,129 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:17:44,129 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:17:44,130 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strcat_short_true-termination.c.i [2018-11-28 23:17:44,197 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397ca7a82/bbaec9a2d10b4693a8942f42cb2824d4/FLAG10b511491 [2018-11-28 23:17:44,786 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:17:44,788 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strcat_short_true-termination.c.i [2018-11-28 23:17:44,810 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397ca7a82/bbaec9a2d10b4693a8942f42cb2824d4/FLAG10b511491 [2018-11-28 23:17:45,067 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397ca7a82/bbaec9a2d10b4693a8942f42cb2824d4 [2018-11-28 23:17:45,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:17:45,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:17:45,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:45,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:17:45,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:17:45,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a02fbf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45, skipping insertion in model container [2018-11-28 23:17:45,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:17:45,166 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:17:45,566 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:45,583 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:17:45,634 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:45,775 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:17:45,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45 WrapperNode [2018-11-28 23:17:45,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:45,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:45,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:17:45,777 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:17:45,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:45,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:17:45,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:17:45,834 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:17:45,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (1/1) ... [2018-11-28 23:17:45,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:17:45,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:17:45,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:17:45,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:17:45,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (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 [2018-11-28 23:17:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:17:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:17:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:17:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:17:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:17:45,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:17:46,359 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:17:46,359 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-28 23:17:46,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:46 BoogieIcfgContainer [2018-11-28 23:17:46,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:17:46,362 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:17:46,362 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:17:46,365 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:17:46,366 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:46,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:17:45" (1/3) ... [2018-11-28 23:17:46,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e54d422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:46, skipping insertion in model container [2018-11-28 23:17:46,367 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:46,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:45" (2/3) ... [2018-11-28 23:17:46,368 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e54d422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:46, skipping insertion in model container [2018-11-28 23:17:46,368 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:46,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:46" (3/3) ... [2018-11-28 23:17:46,370 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcat_short_true-termination.c.i [2018-11-28 23:17:46,430 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:17:46,431 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:17:46,431 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:17:46,431 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:17:46,432 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:17:46,432 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:17:46,432 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:17:46,433 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:17:46,433 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:17:46,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:17:46,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:17:46,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:46,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:46,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:17:46,485 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:46,485 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:17:46,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:17:46,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:17:46,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:46,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:46,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:17:46,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:46,498 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true 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; 20#L527true assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 16#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);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;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; 14#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3#L509-4true [2018-11-28 23:17:46,500 INFO L796 eck$LassoCheckResult]: Loop: 3#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 15#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; 19#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-28 23:17:46,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-11-28 23:17:46,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:46,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:46,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:46,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:46,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2018-11-28 23:17:46,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:46,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:46,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:46,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:46,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:46,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2018-11-28 23:17:46,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:46,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:46,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:46,987 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 23:17:48,105 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-28 23:17:48,299 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-28 23:17:48,311 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:48,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:48,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:48,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:48,313 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:48,314 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:48,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:48,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:48,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:17:48,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:48,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:48,345 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-28 23:17:48,353 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-28 23:17:48,359 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-28 23:17:48,364 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-28 23:17:48,371 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-28 23:17:48,376 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-28 23:17:48,379 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-28 23:17:48,385 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-28 23:17:48,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:48,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:48,408 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-28 23:17:48,411 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-28 23:17:48,414 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-28 23:17:48,422 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-28 23:17:48,460 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-28 23:17:48,465 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-28 23:17:48,467 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-28 23:17:48,482 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-28 23:17:48,496 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-28 23:17:48,920 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2018-11-28 23:17:49,003 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-28 23:17:49,006 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-28 23:17:49,011 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-28 23:17:49,015 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-28 23:17:49,416 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:17:49,793 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:49,799 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:49,801 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-28 23:17:49,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,812 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-28 23:17:49,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,817 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-28 23:17:49,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:49,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:49,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,828 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-28 23:17:49,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,833 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-28 23:17:49,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,839 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-28 23:17:49,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,844 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-28 23:17:49,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:49,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:49,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,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-28 23:17:49,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,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-28 23:17:49,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,878 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-28 23:17:49,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:49,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:49,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,888 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-28 23:17:49,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,893 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-28 23:17:49,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,899 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-28 23:17:49,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,905 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-28 23:17:49,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,910 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-28 23:17:49,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,916 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-28 23:17:49,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,922 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-28 23:17:49,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,928 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-28 23:17:49,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:49,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:49,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:49,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,934 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-28 23:17:49,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:49,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:49,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,943 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-28 23:17:49,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:49,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:49,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,952 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-28 23:17:49,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:49,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:49,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,961 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-28 23:17:49,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,963 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:49,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,968 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:49,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:49,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:49,995 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-28 23:17:49,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:49,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:49,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:49,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:49,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:50,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:50,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:50,005 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-28 23:17:50,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:50,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:50,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:50,006 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:50,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:50,008 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:50,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:50,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:50,013 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-28 23:17:50,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:50,015 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:50,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:50,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:50,018 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:50,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:50,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:50,063 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-28 23:17:50,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:50,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:50,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:50,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:50,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:50,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:50,147 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:50,200 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:17:50,201 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:17:50,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:50,205 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:17:50,206 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:50,207 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-28 23:17:50,299 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:17:50,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:17:50,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:50,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:50,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:50,530 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-28 23:17:50,545 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-28 23:17:50,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 5 states. [2018-11-28 23:17:50,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 5 states. Result 45 states and 60 transitions. Complement of second has 8 states. [2018-11-28 23:17:50,696 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-28 23:17:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-28 23:17:50,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:17:50,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:50,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:17:50,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:50,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 23:17:50,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:50,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-28 23:17:50,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:17:50,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 18 states and 21 transitions. [2018-11-28 23:17:50,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:17:50,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:17:50,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 23:17:50,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:50,714 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 23:17:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 23:17:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-28 23:17:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:17:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 23:17:50,739 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:17:50,739 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:17:50,739 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:17:50,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 23:17:50,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:17:50,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:50,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:50,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:50,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:17:50,741 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 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; 170#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; 171#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 176#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);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;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; 175#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 167#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 168#L516-2 [2018-11-28 23:17:50,741 INFO L796 eck$LassoCheckResult]: Loop: 168#L516-2 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); 169#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; 168#L516-2 [2018-11-28 23:17:50,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2018-11-28 23:17:50,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:50,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:50,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:50,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:50,905 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-28 23:17:50,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:50,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:17:50,910 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:50,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:50,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2470, now seen corresponding path program 1 times [2018-11-28 23:17:50,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:50,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:50,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:50,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:51,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:17:51,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:17:51,048 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 23:17:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:51,101 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 23:17:51,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:17:51,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 23:17:51,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:17:51,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 23:17:51,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:17:51,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:17:51,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-28 23:17:51,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:51,105 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:17:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-28 23:17:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 23:17:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:17:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 23:17:51,107 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:17:51,107 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:17:51,107 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:17:51,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-28 23:17:51,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:17:51,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:51,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:51,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:51,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:17:51,109 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 211#L-1 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; 209#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; 210#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 215#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);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;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; 214#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 201#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 202#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 205#L509-5 strlen_#res := strlen_~i~0; 206#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 207#L516-2 [2018-11-28 23:17:51,109 INFO L796 eck$LassoCheckResult]: Loop: 207#L516-2 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); 208#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; 207#L516-2 [2018-11-28 23:17:51,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:51,110 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2018-11-28 23:17:51,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:51,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:51,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:51,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:51,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:51,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2470, now seen corresponding path program 2 times [2018-11-28 23:17:51,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:51,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:51,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:51,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:51,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:51,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:51,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1497947671, now seen corresponding path program 1 times [2018-11-28 23:17:51,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:51,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:51,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:51,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:51,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:51,516 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:17:52,137 WARN L180 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 119 [2018-11-28 23:17:52,303 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-28 23:17:52,306 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:52,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:52,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:52,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:52,307 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:52,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:52,307 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:52,307 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:52,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:17:52,307 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:52,307 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:52,314 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-28 23:17:52,326 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-28 23:17:52,327 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-28 23:17:52,328 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-28 23:17:52,330 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-28 23:17:52,331 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-28 23:17:52,335 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-28 23:17:52,336 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-28 23:17:52,338 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-28 23:17:52,340 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-28 23:17:52,341 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-28 23:17:52,342 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-28 23:17:52,344 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-28 23:17:52,906 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2018-11-28 23:17:53,112 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-11-28 23:17:53,112 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-28 23:17:53,115 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-28 23:17:53,117 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-28 23:17:53,119 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-28 23:17:53,121 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-28 23:17:53,123 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-28 23:17:53,126 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-28 23:17:53,128 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-28 23:17:53,749 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 23:17:54,035 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:54,035 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:54,036 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-28 23:17:54,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,042 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-28 23:17:54,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,047 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-28 23:17:54,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,051 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-28 23:17:54,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,056 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-28 23:17:54,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,063 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-28 23:17:54,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:54,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:54,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,069 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-28 23:17:54,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,075 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-28 23:17:54,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,077 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-28 23:17:54,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,084 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-28 23:17:54,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,092 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-28 23:17:54,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:54,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:54,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:54,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,097 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-28 23:17:54,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:54,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:54,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,104 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-28 23:17:54,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:54,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:54,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,115 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-28 23:17:54,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:54,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:54,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:54,123 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-28 23:17:54,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:54,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:54,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:54,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:54,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:54,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:54,194 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:54,241 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:17:54,246 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:17:54,246 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:54,248 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:17:54,249 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:54,249 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcat_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_strcat_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2018-11-28 23:17:54,534 INFO L297 tatePredicateManager]: 18 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 23:17:54,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:17:54,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:54,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:54,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:55,002 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 23:17:55,003 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-28 23:17:55,003 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-28 23:17:55,003 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-28 23:17:55,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 25 states and 28 transitions. Complement of second has 10 states. [2018-11-28 23:17:55,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-28 23:17:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:17:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-11-28 23:17:55,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:17:55,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:55,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 23:17:55,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:55,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:17:55,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:55,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-11-28 23:17:55,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:17:55,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 19 transitions. [2018-11-28 23:17:55,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:17:55,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:17:55,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2018-11-28 23:17:55,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:55,218 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-28 23:17:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2018-11-28 23:17:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-28 23:17:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:17:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-28 23:17:55,222 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 23:17:55,222 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 23:17:55,222 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:17:55,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-28 23:17:55,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:17:55,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:55,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:55,224 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:55,228 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:17:55,228 INFO L794 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 413#L-1 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; 411#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; 412#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 417#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);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;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; 416#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 403#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 404#L509-1 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; 415#L509-3 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; 405#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 406#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 407#L509-5 strlen_#res := strlen_~i~0; 408#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 409#L516-2 [2018-11-28 23:17:55,228 INFO L796 eck$LassoCheckResult]: Loop: 409#L516-2 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); 410#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; 409#L516-2 [2018-11-28 23:17:55,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:55,228 INFO L82 PathProgramCache]: Analyzing trace with hash -755103244, now seen corresponding path program 1 times [2018-11-28 23:17:55,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:55,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:55,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:55,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2470, now seen corresponding path program 3 times [2018-11-28 23:17:55,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:55,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:55,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:55,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash 195257049, now seen corresponding path program 1 times [2018-11-28 23:17:55,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:55,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:55,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:55,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:55,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:55,505 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:17:56,028 WARN L180 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 134 [2018-11-28 23:17:56,180 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-11-28 23:17:56,182 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:56,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:56,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:56,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:56,183 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:56,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:56,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:56,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:56,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:17:56,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:56,183 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:56,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-28 23:17:56,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:56,203 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-28 23:17:56,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:56,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:56,211 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-28 23:17:56,220 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-28 23:17:56,222 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-28 23:17:56,225 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-28 23:17:56,227 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-28 23:17:56,250 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-28 23:17:56,254 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-28 23:17:56,256 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-28 23:17:56,259 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-28 23:17:56,260 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-28 23:17:56,262 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-28 23:17:56,263 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-28 23:17:56,266 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-28 23:17:56,268 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-28 23:17:56,860 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2018-11-28 23:17:57,074 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-11-28 23:17:57,075 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-28 23:17:57,081 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-28 23:17:57,415 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:17:57,881 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:57,881 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:57,881 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-28 23:17:57,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,887 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-28 23:17:57,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:57,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,895 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-28 23:17:57,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,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-28 23:17:57,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,906 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-28 23:17:57,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,911 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-28 23:17:57,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,915 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-28 23:17:57,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,917 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-28 23:17:57,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,924 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-28 23:17:57,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:57,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,927 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-28 23:17:57,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,929 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-28 23:17:57,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,931 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-28 23:17:57,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,933 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-28 23:17:57,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,935 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-28 23:17:57,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,937 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-28 23:17:57,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,939 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-28 23:17:57,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,941 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-28 23:17:57,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,943 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-28 23:17:57,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:57,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,945 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-28 23:17:57,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,945 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:57,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,946 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:57,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,949 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-28 23:17:57,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:57,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,953 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-28 23:17:57,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:57,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,956 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-28 23:17:57,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,957 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:57,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,959 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:57,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,968 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-28 23:17:57,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:57,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,969 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:57,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,969 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:57,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:57,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,971 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-28 23:17:57,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:57,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,977 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-28 23:17:57,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,978 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:57,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:57,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,986 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-28 23:17:57,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:57,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,993 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-28 23:17:57,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:57,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,997 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-28 23:17:57,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:57,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:57,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:57,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:57,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:57,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:57,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:57,999 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-28 23:17:58,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:58,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:58,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:58,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:58,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:58,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:58,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:58,008 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-28 23:17:58,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:58,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:58,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:58,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:58,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:58,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:58,054 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:58,110 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:17:58,110 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:17:58,111 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:58,111 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:17:58,115 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:58,115 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcat_~t.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_strcat_~t.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2018-11-28 23:17:58,273 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:17:58,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:17:58,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:58,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:58,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:58,338 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-28 23:17:58,338 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 [2018-11-28 23:17:58,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:17:58,366 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 17 states and 19 transitions. Complement of second has 5 states. [2018-11-28 23:17:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:17:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:17:58,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 23:17:58,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:58,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-28 23:17:58,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:58,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-28 23:17:58,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:58,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-28 23:17:58,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:17:58,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2018-11-28 23:17:58,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:17:58,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:17:58,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:17:58,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:17:58,371 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:17:58,371 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:17:58,372 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:17:58,372 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:17:58,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:17:58,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:17:58,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:17:58,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:17:58 BoogieIcfgContainer [2018-11-28 23:17:58,379 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:17:58,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:17:58,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:17:58,380 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:17:58,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:46" (3/4) ... [2018-11-28 23:17:58,384 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:17:58,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:17:58,385 INFO L168 Benchmark]: Toolchain (without parser) took 13313.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 943.3 MB in the beginning and 1.2 GB in the end (delta: -274.7 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:58,387 INFO L168 Benchmark]: CDTParser took 0.21 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. [2018-11-28 23:17:58,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:58,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:58,389 INFO L168 Benchmark]: Boogie Preprocessor took 36.67 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-28 23:17:58,390 INFO L168 Benchmark]: RCFGBuilder took 489.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:58,390 INFO L168 Benchmark]: BuchiAutomizer took 12017.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.7 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:58,391 INFO L168 Benchmark]: Witness Printer took 5.06 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:17:58,396 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.21 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 702.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.67 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 489.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12017.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.7 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.06 ms. Allocated memory is still 1.4 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 - 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 4 terminating modules (1 trivial, 3 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 -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 8 locations. One deterministic module has affine ranking function -1 * t + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 10.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 79 SDslu, 41 SDs, 0 SdLazy, 52 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital241 mio100 ax100 hnf99 lsp96 ukn84 mio100 lsp46 div100 bol100 ite100 ukn100 eq189 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms 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...