./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strlcpy_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strlcpy_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 fd4754e908bed6ae29d10e34d903201d1cfa0296 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:24:58,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:24:58,333 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:24:58,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:24:58,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:24:58,356 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:24:58,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:24:58,362 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:24:58,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:24:58,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:24:58,368 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:24:58,369 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:24:58,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:24:58,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:24:58,382 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:24:58,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:24:58,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:24:58,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:24:58,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:24:58,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:24:58,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:24:58,400 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:24:58,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:24:58,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:24:58,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:24:58,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:24:58,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:24:58,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:24:58,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:24:58,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:24:58,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:24:58,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:24:58,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:24:58,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:24:58,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:24:58,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:24:58,423 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:24:58,453 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:24:58,453 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:24:58,458 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:24:58,459 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:24:58,459 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:24:58,459 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:24:58,459 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:24:58,459 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:24:58,460 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:24:58,461 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:24:58,461 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:24:58,462 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:24:58,462 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:24:58,462 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:24:58,462 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:24:58,462 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:24:58,463 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:24:58,464 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:24:58,464 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:24:58,464 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:24:58,464 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:24:58,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:24:58,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:24:58,465 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:24:58,465 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:24:58,465 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:24:58,465 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:24:58,466 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:24:58,468 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:24:58,468 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 -> fd4754e908bed6ae29d10e34d903201d1cfa0296 [2019-01-14 02:24:58,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:24:58,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:24:58,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:24:58,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:24:58,526 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:24:58,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strlcpy_true-termination.c.i [2019-01-14 02:24:58,595 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce1781e1/4a25b6a618894d2e99e8089113be49bf/FLAG5769592b4 [2019-01-14 02:24:59,192 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:24:59,193 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strlcpy_true-termination.c.i [2019-01-14 02:24:59,208 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce1781e1/4a25b6a618894d2e99e8089113be49bf/FLAG5769592b4 [2019-01-14 02:24:59,502 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce1781e1/4a25b6a618894d2e99e8089113be49bf [2019-01-14 02:24:59,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:24:59,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:24:59,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:24:59,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:24:59,515 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:24:59,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:24:59" (1/1) ... [2019-01-14 02:24:59,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453f9d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:59, skipping insertion in model container [2019-01-14 02:24:59,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:24:59" (1/1) ... [2019-01-14 02:24:59,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:24:59,589 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:25:00,052 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:25:00,075 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:25:00,141 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:25:00,307 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:25:00,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00 WrapperNode [2019-01-14 02:25:00,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:25:00,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:25:00,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:25:00,309 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:25:00,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... [2019-01-14 02:25:00,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... [2019-01-14 02:25:00,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:25:00,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:25:00,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:25:00,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:25:00,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... [2019-01-14 02:25:00,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... [2019-01-14 02:25:00,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... [2019-01-14 02:25:00,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... [2019-01-14 02:25:00,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... [2019-01-14 02:25:00,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... [2019-01-14 02:25:00,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... [2019-01-14 02:25:00,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:25:00,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:25:00,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:25:00,431 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:25:00,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:00,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:25:00,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:25:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:25:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:25:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:25:00,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:25:00,970 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:25:00,970 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:25:00,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:00 BoogieIcfgContainer [2019-01-14 02:25:00,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:25:00,973 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:25:00,973 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:25:00,976 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:25:00,977 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:00,977 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:24:59" (1/3) ... [2019-01-14 02:25:00,978 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27f4502d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:25:00, skipping insertion in model container [2019-01-14 02:25:00,979 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:00,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:00" (2/3) ... [2019-01-14 02:25:00,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27f4502d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:25:00, skipping insertion in model container [2019-01-14 02:25:00,979 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:00,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:00" (3/3) ... [2019-01-14 02:25:00,981 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcpy_true-termination.c.i [2019-01-14 02:25:01,045 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:25:01,046 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:25:01,046 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:25:01,047 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:25:01,047 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:25:01,047 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:25:01,047 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:25:01,047 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:25:01,048 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:25:01,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-14 02:25:01,086 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:25:01,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:01,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:01,095 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:25:01,095 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:25:01,095 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:25:01,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-14 02:25:01,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:25:01,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:01,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:01,098 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:25:01,098 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:25:01,107 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 19#L530true assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 9#L534true assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 6#L514true assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 11#L514-2true assume strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 12#L515-4true [2019-01-14 02:25:01,108 INFO L796 eck$LassoCheckResult]: Loop: 12#L515-4true strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, 1 + strlcpy_#t~post5.offset;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, 1 + strlcpy_#t~post6.offset;call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1);call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1); 3#L516true assume !(0 == strlcpy_#t~mem7);havoc strlcpy_#t~mem7;havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset; 7#L515-1true strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1; 8#L515-2true assume !!(0 != strlcpy_#t~pre4 % 4294967296);havoc strlcpy_#t~pre4; 12#L515-4true [2019-01-14 02:25:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash 889571278, now seen corresponding path program 1 times [2019-01-14 02:25:01,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:01,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:01,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:01,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1698155, now seen corresponding path program 1 times [2019-01-14 02:25:01,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:01,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:01,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:01,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:01,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash 707592888, now seen corresponding path program 1 times [2019-01-14 02:25:01,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:01,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:01,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:01,730 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 02:25:01,926 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-14 02:25:03,006 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-01-14 02:25:03,237 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-01-14 02:25:03,250 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:25:03,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:25:03,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:25:03,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:25:03,253 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:25:03,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:03,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:25:03,253 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:25:03,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:25:03,254 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:25:03,255 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:25:03,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:03,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:03,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:03,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:03,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:03,910 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-01-14 02:25:04,089 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-01-14 02:25:04,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:04,866 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-01-14 02:25:04,989 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-01-14 02:25:05,309 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-14 02:25:05,804 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:25:05,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:25:05,901 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:25:05,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:05,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:05,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:05,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:05,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:05,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:05,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:05,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:05,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:05,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:05,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:05,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:05,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:05,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:05,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:05,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:05,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:05,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:05,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 [2019-01-14 02:25:05,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:05,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:05,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:05,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:05,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:05,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:05,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:05,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:05,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:05,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:05,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:05,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:05,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:05,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:05,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:05,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:05,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 [2019-01-14 02:25:05,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:05,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:05,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:05,928 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:25:05,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:05,929 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:25:05,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:05,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:05,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 [2019-01-14 02:25:05,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:05,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:05,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:05,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:05,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:05,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:06,110 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:25:06,230 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:25:06,231 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:25:06,233 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:25:06,236 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:25:06,242 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:25:06,243 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlcpy_~d~0.base)_1, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_strlcpy_~d~0.base)_1 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2019-01-14 02:25:06,537 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 02:25:06,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:25:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:06,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:06,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:25:06,844 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 [2019-01-14 02:25:06,845 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 5 states. [2019-01-14 02:25:07,027 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 5 states. Result 66 states and 85 transitions. Complement of second has 8 states. [2019-01-14 02:25:07,029 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 [2019-01-14 02:25:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:25:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2019-01-14 02:25:07,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:25:07,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:07,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:25:07,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:07,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-14 02:25:07,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:07,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 85 transitions. [2019-01-14 02:25:07,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:25:07,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 24 states and 30 transitions. [2019-01-14 02:25:07,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:25:07,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:25:07,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2019-01-14 02:25:07,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:25:07,064 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-01-14 02:25:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2019-01-14 02:25:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2019-01-14 02:25:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:25:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-01-14 02:25:07,095 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 02:25:07,095 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 02:25:07,095 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:25:07,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-01-14 02:25:07,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:25:07,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:07,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:07,097 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:07,097 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:25:07,097 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 218#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 219#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 213#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 210#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 211#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 205#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 217#L521 assume !(0 != strlcpy_~siz % 4294967296); 215#L523-2 [2019-01-14 02:25:07,098 INFO L796 eck$LassoCheckResult]: Loop: 215#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 214#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 215#L523-2 [2019-01-14 02:25:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:07,098 INFO L82 PathProgramCache]: Analyzing trace with hash 179527912, now seen corresponding path program 1 times [2019-01-14 02:25:07,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:07,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:07,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:07,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:25:07,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:25:07,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:25:07,310 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:25:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 1 times [2019-01-14 02:25:07,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:07,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:07,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:25:07,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:25:07,384 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-14 02:25:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:25:07,513 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-01-14 02:25:07,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:25:07,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2019-01-14 02:25:07,517 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 02:25:07,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2019-01-14 02:25:07,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:25:07,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 02:25:07,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-01-14 02:25:07,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:25:07,519 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-01-14 02:25:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-01-14 02:25:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2019-01-14 02:25:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:25:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-01-14 02:25:07,522 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 02:25:07,522 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 02:25:07,522 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:25:07,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-01-14 02:25:07,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:25:07,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:07,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:07,526 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:07,526 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:25:07,526 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 275#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 269#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 265#L514 assume !strlcpy_#t~short3; 266#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 278#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 277#L521 assume !(0 != strlcpy_~siz % 4294967296); 271#L523-2 [2019-01-14 02:25:07,526 INFO L796 eck$LassoCheckResult]: Loop: 271#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 270#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 271#L523-2 [2019-01-14 02:25:07,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:07,527 INFO L82 PathProgramCache]: Analyzing trace with hash 179587494, now seen corresponding path program 1 times [2019-01-14 02:25:07,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:07,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:07,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:07,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:07,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 2 times [2019-01-14 02:25:07,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:07,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:07,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:07,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash 784891691, now seen corresponding path program 1 times [2019-01-14 02:25:07,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:07,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:07,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:25:07,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:07,767 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 02:25:08,129 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2019-01-14 02:25:08,286 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-14 02:25:08,288 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:25:08,289 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:25:08,289 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:25:08,289 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:25:08,289 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:25:08,289 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:08,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:25:08,289 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:25:08,290 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:25:08,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:25:08,290 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:25:08,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,769 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-01-14 02:25:08,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:08,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:09,143 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-01-14 02:25:09,699 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:25:09,808 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:25:09,808 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:25:09,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:09,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:09,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:09,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:09,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:09,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:09,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:09,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:09,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:09,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:09,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:09,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:09,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:09,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:09,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:09,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:09,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:09,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:09,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:09,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:09,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:09,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:09,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:09,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:09,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:09,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:09,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:09,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:09,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,872 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:25:09,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:25:09,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:09,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,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 [2019-01-14 02:25:09,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:09,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:09,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:09,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:09,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:09,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:09,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:09,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:09,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,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 [2019-01-14 02:25:09,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,911 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:25:09,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,917 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:25:09,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:09,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:09,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:09,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:09,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:09,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:09,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:09,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:09,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:09,974 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:25:10,002 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:25:10,002 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:25:10,003 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:25:10,004 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:25:10,005 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:25:10,005 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2019-01-14 02:25:10,197 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-01-14 02:25:10,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:25:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:10,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:10,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:25:10,527 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:25:10,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 02:25:10,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 24 states and 30 transitions. Complement of second has 5 states. [2019-01-14 02:25:10,608 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 [2019-01-14 02:25:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:25:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-14 02:25:10,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:25:10,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:10,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:25:10,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:10,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:25:10,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:10,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2019-01-14 02:25:10,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:25:10,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2019-01-14 02:25:10,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:25:10,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:25:10,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-01-14 02:25:10,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:25:10,615 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-14 02:25:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-01-14 02:25:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-14 02:25:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:25:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-14 02:25:10,618 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 02:25:10,618 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 02:25:10,618 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:25:10,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-01-14 02:25:10,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:25:10,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:10,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:10,621 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:10,621 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:25:10,621 INFO L794 eck$LassoCheckResult]: Stem: 404#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 402#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 403#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 397#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 392#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 393#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 389#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 401#L521 assume 0 != strlcpy_~siz % 4294967296;call write~int(0, strlcpy_~d~0.base, strlcpy_~d~0.offset, 1); 399#L523-2 [2019-01-14 02:25:10,621 INFO L796 eck$LassoCheckResult]: Loop: 399#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 398#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 399#L523-2 [2019-01-14 02:25:10,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:10,622 INFO L82 PathProgramCache]: Analyzing trace with hash 179527910, now seen corresponding path program 1 times [2019-01-14 02:25:10,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:10,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:10,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:10,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:10,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 3 times [2019-01-14 02:25:10,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:10,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:10,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:10,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:10,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:10,684 INFO L82 PathProgramCache]: Analyzing trace with hash 727631467, now seen corresponding path program 1 times [2019-01-14 02:25:10,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:10,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:10,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:10,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:25:10,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:10,898 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 02:25:11,315 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 113 [2019-01-14 02:25:11,457 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 02:25:11,459 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:25:11,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:25:11,460 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:25:11,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:25:11,460 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:25:11,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:11,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:25:11,460 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:25:11,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:25:11,460 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:25:11,460 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:25:11,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,028 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-01-14 02:25:12,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,516 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-14 02:25:13,137 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:25:13,315 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:25:13,315 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:25:13,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:13,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:13,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:13,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:13,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:13,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:13,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:13,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:13,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:13,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:13,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:13,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:13,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:13,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:13,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:13,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:13,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:13,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:13,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:13,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:13,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:13,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:13,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:13,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:13,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:13,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,374 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:25:13,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,384 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:25:13,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:13,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:13,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,409 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:25:13,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,412 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:25:13,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:13,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:13,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:13,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:13,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:13,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:13,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:13,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:13,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:13,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:13,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:13,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:13,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:13,460 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:25:13,492 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:25:13,493 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:25:13,494 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:25:13,495 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:25:13,495 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:25:13,495 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlcpy_~s~0.base)_3, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_strlcpy_~s~0.base)_3 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2019-01-14 02:25:13,726 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:25:13,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:25:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:13,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:13,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:25:13,886 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:25:13,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:25:13,894 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 19 states and 23 transitions. Complement of second has 4 states. [2019-01-14 02:25:13,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:25:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:25:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-01-14 02:25:13,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:25:13,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:13,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:25:13,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:13,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:25:13,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:13,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-01-14 02:25:13,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:25:13,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-01-14 02:25:13,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:25:13,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:25:13,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:25:13,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:25:13,901 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:25:13,902 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:25:13,902 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:25:13,902 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:25:13,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:25:13,902 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:25:13,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:25:13,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:25:13 BoogieIcfgContainer [2019-01-14 02:25:13,909 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:25:13,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:25:13,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:25:13,910 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:25:13,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:00" (3/4) ... [2019-01-14 02:25:13,914 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:25:13,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:25:13,915 INFO L168 Benchmark]: Toolchain (without parser) took 14409.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 118.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:13,917 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:25:13,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:13,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:25:13,919 INFO L168 Benchmark]: Boogie Preprocessor took 47.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:25:13,919 INFO L168 Benchmark]: RCFGBuilder took 541.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:13,920 INFO L168 Benchmark]: BuchiAutomizer took 12936.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.4 MB). Peak memory consumption was 125.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:13,921 INFO L168 Benchmark]: Witness Printer took 4.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:25:13,925 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 799.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 541.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12936.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.4 MB). Peak memory consumption was 125.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 unknown-#length-unknown[d] + -1 * s and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 11.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 84 SDtfs, 100 SDslu, 47 SDs, 0 SdLazy, 42 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital211 mio100 ax100 hnf99 lsp97 ukn86 mio100 lsp47 div173 bol100 ite100 ukn100 eq175 hnf68 smp95 dnf178 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 11 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...