./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fd4754e908bed6ae29d10e34d903201d1cfa0296 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:02:51,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:02:51,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:02:51,321 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:02:51,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:02:51,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:02:51,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:02:51,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:02:51,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:02:51,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:02:51,327 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:02:51,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:02:51,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:02:51,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:02:51,329 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:02:51,330 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:02:51,331 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:02:51,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:02:51,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:02:51,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:02:51,336 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:02:51,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:02:51,338 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:02:51,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:02:51,339 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:02:51,339 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:02:51,340 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:02:51,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:02:51,341 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:02:51,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:02:51,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:02:51,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:02:51,343 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:02:51,343 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:02:51,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:02:51,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:02:51,345 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:02:51,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:02:51,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:02:51,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:02:51,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:02:51,358 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:02:51,358 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:02:51,359 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:02:51,359 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:02:51,359 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:02:51,359 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:02:51,359 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:02:51,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:02:51,359 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:02:51,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:02:51,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:02:51,360 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:02:51,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:02:51,360 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:02:51,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:02:51,360 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:02:51,361 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:02:51,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:02:51,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:02:51,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:02:51,361 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:02:51,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:02:51,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:02:51,362 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:02:51,362 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:02:51,362 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd4754e908bed6ae29d10e34d903201d1cfa0296 [2018-11-28 12:02:51,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:02:51,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:02:51,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:02:51,400 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:02:51,401 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:02:51,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-28 12:02:51,447 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/data/d289e072d/4ea8d622290b48fc836dc5cbdf98fa68/FLAG3fde0e353 [2018-11-28 12:02:51,802 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:02:51,803 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-28 12:02:51,812 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/data/d289e072d/4ea8d622290b48fc836dc5cbdf98fa68/FLAG3fde0e353 [2018-11-28 12:02:52,203 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/data/d289e072d/4ea8d622290b48fc836dc5cbdf98fa68 [2018-11-28 12:02:52,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:02:52,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:02:52,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:02:52,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:02:52,208 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:02:52,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712e1164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52, skipping insertion in model container [2018-11-28 12:02:52,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:02:52,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:02:52,421 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:02:52,430 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:02:52,510 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:02:52,536 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:02:52,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52 WrapperNode [2018-11-28 12:02:52,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:02:52,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:02:52,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:02:52,537 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:02:52,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:02:52,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:02:52,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:02:52,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:02:52,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... [2018-11-28 12:02:52,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:02:52,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:02:52,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:02:52,600 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:02:52,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97c1bc27-da88-4b11-849e-a7959b54d8af/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:02:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:02:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:02:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:02:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:02:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:02:52,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:02:52,827 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:02:52,828 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 12:02:52,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:52 BoogieIcfgContainer [2018-11-28 12:02:52,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:02:52,829 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:02:52,829 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:02:52,833 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:02:52,833 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:02:52,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:02:52" (1/3) ... [2018-11-28 12:02:52,835 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bbef451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:02:52, skipping insertion in model container [2018-11-28 12:02:52,835 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:02:52,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:52" (2/3) ... [2018-11-28 12:02:52,835 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bbef451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:02:52, skipping insertion in model container [2018-11-28 12:02:52,835 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:02:52,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:52" (3/3) ... [2018-11-28 12:02:52,841 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcpy_true-termination.c.i [2018-11-28 12:02:52,887 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:02:52,888 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:02:52,888 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:02:52,888 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:02:52,888 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:02:52,888 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:02:52,889 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:02:52,889 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:02:52,889 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:02:52,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 12:02:52,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 12:02:52,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:02:52,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:02:52,926 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:02:52,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:02:52,926 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:02:52,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 12:02:52,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 12:02:52,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:02:52,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:02:52,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:02:52,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:02:52,935 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.alloc(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.alloc(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~pre2;havoc strlcpy_#t~short3; 12#L515-4true [2018-11-28 12:02:52,935 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~post5.base, strlcpy_#t~post5.offset;havoc strlcpy_#t~post6.base, strlcpy_#t~post6.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 [2018-11-28 12:02:52,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash 889571278, now seen corresponding path program 1 times [2018-11-28 12:02:52,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:52,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:52,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:52,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:02:52,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:53,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1698155, now seen corresponding path program 1 times [2018-11-28 12:02:53,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:53,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:53,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:53,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:02:53,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:53,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash 707592888, now seen corresponding path program 1 times [2018-11-28 12:02:53,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:53,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:53,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:53,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:02:53,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:53,571 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2018-11-28 12:02:53,675 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:02:53,676 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:02:53,676 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:02:53,676 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:02:53,676 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:02:53,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:02:53,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:02:53,677 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:02:53,677 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration1_Lasso [2018-11-28 12:02:53,677 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:02:53,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:02:53,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:53,940 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-11-28 12:02:54,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:54,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:54,378 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-11-28 12:02:54,677 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:02:54,682 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:02:54,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:54,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:54,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:54,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:54,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:54,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:54,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,736 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:02:54,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:02:54,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:54,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:54,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:54,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:54,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:54,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:54,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:54,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:54,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:54,811 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:02:54,872 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:02:54,872 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 12:02:54,874 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:02:54,875 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:02:54,875 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:02:54,876 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_strlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-11-28 12:02:54,926 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-28 12:02:54,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:02:54,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:02:54,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:02:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:02:55,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:02:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:02:55,061 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 12:02:55,063 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2018-11-28 12:02:55,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 50 states and 71 transitions. Complement of second has 7 states. [2018-11-28 12:02:55,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:02:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:02:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-28 12:02:55,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:02:55,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:02:55,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 12:02:55,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:02:55,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 12:02:55,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:02:55,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2018-11-28 12:02:55,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:02:55,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 10 states and 12 transitions. [2018-11-28 12:02:55,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 12:02:55,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 12:02:55,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-28 12:02:55,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:02:55,161 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 12:02:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-28 12:02:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 12:02:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 12:02:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 12:02:55,186 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 12:02:55,186 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 12:02:55,186 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:02:55,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-28 12:02:55,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:02:55,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:02:55,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:02:55,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:02:55,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:02:55,187 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 183#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; 184#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(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; 191#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;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; 189#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; 190#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 192#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 187#L521 assume !(0 != strlcpy_~siz % 4294967296); 185#L523-2 [2018-11-28 12:02:55,187 INFO L796 eck$LassoCheckResult]: Loop: 185#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); 186#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 185#L523-2 [2018-11-28 12:02:55,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash 179527912, now seen corresponding path program 1 times [2018-11-28 12:02:55,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:55,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:02:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:02:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:02:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:02:55,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:02:55,283 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:02:55,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 1 times [2018-11-28 12:02:55,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:55,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:02:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:55,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:02:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:02:55,320 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 12:02:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:02:55,360 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 12:02:55,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:02:55,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 12:02:55,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 12:02:55,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 12:02:55,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 12:02:55,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 12:02:55,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-28 12:02:55,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:02:55,362 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 12:02:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-28 12:02:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-11-28 12:02:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 12:02:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-28 12:02:55,363 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 12:02:55,363 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 12:02:55,364 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:02:55,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-28 12:02:55,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:02:55,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:02:55,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:02:55,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:02:55,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:02:55,366 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#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; 218#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(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; 223#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;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; 224#L514 assume !strlcpy_#t~short3; 225#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 229#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 228#L521 assume !(0 != strlcpy_~siz % 4294967296); 220#L523-2 [2018-11-28 12:02:55,366 INFO L796 eck$LassoCheckResult]: Loop: 220#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); 221#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 220#L523-2 [2018-11-28 12:02:55,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:55,366 INFO L82 PathProgramCache]: Analyzing trace with hash 179587494, now seen corresponding path program 1 times [2018-11-28 12:02:55,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:55,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:55,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:02:55,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:55,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:55,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 2 times [2018-11-28 12:02:55,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:55,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:02:55,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:55,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash 784891691, now seen corresponding path program 1 times [2018-11-28 12:02:55,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:55,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:02:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:55,623 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2018-11-28 12:02:55,689 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:02:55,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:02:55,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:02:55,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:02:55,690 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:02:55,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:02:55,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:02:55,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:02:55,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration3_Lasso [2018-11-28 12:02:55,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:02:55,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:02:55,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,868 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-28 12:02:55,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:55,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,202 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:02:56,202 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:02:56,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:56,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:56,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:56,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:56,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:56,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:56,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:56,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:56,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:56,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:56,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,255 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:02:56,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,257 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:02:56,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:56,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:56,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:56,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:56,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:56,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:56,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:56,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:56,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:56,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:56,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:56,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:56,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:56,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:56,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:56,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:56,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:56,285 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:02:56,293 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:02:56,293 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:02:56,293 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:02:56,294 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:02:56,294 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:02:56,294 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 [] [2018-11-28 12:02:56,343 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 12:02:56,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:02:56,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:02:56,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:02:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:02:56,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:02:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:02:56,448 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 12:02:56,448 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 12:02:56,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 17 states and 19 transitions. Complement of second has 5 states. [2018-11-28 12:02:56,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:02:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:02:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 12:02:56,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 12:02:56,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:02:56,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 12:02:56,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:02:56,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 12:02:56,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:02:56,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-28 12:02:56,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:02:56,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 14 transitions. [2018-11-28 12:02:56,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 12:02:56,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:02:56,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-28 12:02:56,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:02:56,479 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-28 12:02:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-28 12:02:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-11-28 12:02:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 12:02:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-11-28 12:02:56,480 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-11-28 12:02:56,480 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-11-28 12:02:56,481 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:02:56,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2018-11-28 12:02:56,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:02:56,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:02:56,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:02:56,481 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:02:56,481 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:02:56,481 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 332#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; 333#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(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; 338#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;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; 339#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; 340#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 341#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 334#L521 assume 0 != strlcpy_~siz % 4294967296;call write~int(0, strlcpy_~d~0.base, strlcpy_~d~0.offset, 1); 335#L523-2 [2018-11-28 12:02:56,482 INFO L796 eck$LassoCheckResult]: Loop: 335#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); 336#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 335#L523-2 [2018-11-28 12:02:56,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash 179527910, now seen corresponding path program 1 times [2018-11-28 12:02:56,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:56,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:56,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:02:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:56,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 3 times [2018-11-28 12:02:56,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:56,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:56,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:02:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:56,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash 727631467, now seen corresponding path program 1 times [2018-11-28 12:02:56,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:02:56,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:02:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:56,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:02:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:02:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:02:56,774 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 110 [2018-11-28 12:02:56,854 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:02:56,854 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:02:56,854 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:02:56,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:02:56,854 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:02:56,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:02:56,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:02:56,854 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:02:56,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration4_Lasso [2018-11-28 12:02:56,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:02:56,855 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:02:56,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:56,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,039 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2018-11-28 12:02:57,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:02:57,363 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:02:57,363 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:02:57,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:57,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:57,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,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 [2018-11-28 12:02:57,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:57,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:57,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:57,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:57,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:57,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:57,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:57,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:57,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:57,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:57,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:57,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:57,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:57,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:57,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:57,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:57,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:57,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:57,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:57,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:57,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:57,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:02:57,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:57,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:02:57,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,382 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:02:57,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,382 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:02:57,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:02:57,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:57,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:57,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:57,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:57,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,395 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:02:57,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,397 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:02:57,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:57,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:57,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:57,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,406 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:02:57,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,408 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:02:57,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:57,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:02:57,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:02:57,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:02:57,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:02:57,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:02:57,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:02:57,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:02:57,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:02:57,430 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:02:57,457 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:02:57,457 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:02:57,458 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:02:57,458 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:02:57,458 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:02:57,459 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_strlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2018-11-28 12:02:57,494 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 12:02:57,496 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:02:57,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:02:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:02:57,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:02:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:02:57,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:02:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:02:57,558 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 12:02:57,558 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-28 12:02:57,577 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 12 states and 13 transitions. Complement of second has 5 states. [2018-11-28 12:02:57,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:02:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:02:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 12:02:57,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 12:02:57,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:02:57,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 12:02:57,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:02:57,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 12:02:57,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:02:57,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-28 12:02:57,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:02:57,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-28 12:02:57,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:02:57,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:02:57,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:02:57,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:02:57,581 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:02:57,581 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:02:57,581 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:02:57,581 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:02:57,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:02:57,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:02:57,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:02:57,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:02:57 BoogieIcfgContainer [2018-11-28 12:02:57,587 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:02:57,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:02:57,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:02:57,588 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:02:57,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:52" (3/4) ... [2018-11-28 12:02:57,591 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:02:57,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:02:57,592 INFO L168 Benchmark]: Toolchain (without parser) took 5387.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 956.0 MB in the beginning and 1.3 GB in the end (delta: -360.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:02:57,593 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:02:57,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -195.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:02:57,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:02:57,594 INFO L168 Benchmark]: Boogie Preprocessor took 24.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:02:57,594 INFO L168 Benchmark]: RCFGBuilder took 228.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:02:57,595 INFO L168 Benchmark]: BuchiAutomizer took 4758.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -192.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:02:57,595 INFO L168 Benchmark]: Witness Printer took 3.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:02:57,598 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -195.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4758.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -192.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 5 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 -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 60 SDtfs, 53 SDslu, 33 SDs, 0 SdLazy, 35 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp48 div173 bol100 ite100 ukn100 eq175 hnf68 smp95 dnf100 smp100 tf100 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...