./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/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 31c220d29d6dec1ef33d2c1aa086e47a745ff101 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:34:56,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:34:56,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:34:56,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:34:56,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:34:56,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:34:56,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:34:56,975 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:34:56,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:34:56,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:34:56,978 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:34:56,978 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:34:56,979 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:34:56,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:34:56,981 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:34:56,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:34:56,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:34:56,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:34:56,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:34:56,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:34:56,987 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:34:56,988 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:34:56,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:34:56,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:34:56,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:34:56,990 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:34:56,991 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:34:56,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:34:56,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:34:56,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:34:56,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:34:56,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:34:56,994 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:34:56,994 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:34:56,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:34:56,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:34:56,995 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 10:34:57,006 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:34:57,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:34:57,007 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:34:57,007 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:34:57,007 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:34:57,007 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:34:57,007 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:34:57,008 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:34:57,008 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:34:57,008 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:34:57,008 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:34:57,008 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:34:57,008 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:34:57,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:34:57,009 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:34:57,009 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:34:57,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:34:57,009 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:34:57,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:34:57,009 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:34:57,009 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:34:57,009 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:34:57,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:34:57,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:34:57,010 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:34:57,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:34:57,010 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:34:57,010 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:34:57,011 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:34:57,011 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_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/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 -> 31c220d29d6dec1ef33d2c1aa086e47a745ff101 [2018-11-18 10:34:57,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:34:57,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:34:57,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:34:57,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:34:57,044 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:34:57,045 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i [2018-11-18 10:34:57,083 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/data/ced124efe/e013061001b6468c835a64d80d3e6d4c/FLAGc955c57e6 [2018-11-18 10:34:57,457 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:34:57,458 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i [2018-11-18 10:34:57,469 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/data/ced124efe/e013061001b6468c835a64d80d3e6d4c/FLAGc955c57e6 [2018-11-18 10:34:57,844 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/data/ced124efe/e013061001b6468c835a64d80d3e6d4c [2018-11-18 10:34:57,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:34:57,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:34:57,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:34:57,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:34:57,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:34:57,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:34:57" (1/1) ... [2018-11-18 10:34:57,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a8b42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:57, skipping insertion in model container [2018-11-18 10:34:57,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:34:57" (1/1) ... [2018-11-18 10:34:57,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:34:57,885 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:34:58,081 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:34:58,089 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:34:58,160 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:34:58,186 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:34:58,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58 WrapperNode [2018-11-18 10:34:58,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:34:58,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:34:58,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:34:58,187 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:34:58,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... [2018-11-18 10:34:58,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... [2018-11-18 10:34:58,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:34:58,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:34:58,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:34:58,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:34:58,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... [2018-11-18 10:34:58,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... [2018-11-18 10:34:58,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... [2018-11-18 10:34:58,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... [2018-11-18 10:34:58,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... [2018-11-18 10:34:58,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... [2018-11-18 10:34:58,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... [2018-11-18 10:34:58,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:34:58,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:34:58,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:34:58,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:34:58,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64fdfa42-bff1-4e0d-9ba2-ab92780036ec/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:34:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:34:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:34:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:34:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:34:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:34:58,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:34:58,469 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:34:58,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:34:58 BoogieIcfgContainer [2018-11-18 10:34:58,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:34:58,470 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:34:58,470 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:34:58,472 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:34:58,473 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:34:58,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:34:57" (1/3) ... [2018-11-18 10:34:58,474 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c52a3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:34:58, skipping insertion in model container [2018-11-18 10:34:58,474 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:34:58,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:34:58" (2/3) ... [2018-11-18 10:34:58,474 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c52a3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:34:58, skipping insertion in model container [2018-11-18 10:34:58,475 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:34:58,475 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:34:58" (3/3) ... [2018-11-18 10:34:58,476 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcat_true-termination.c.i [2018-11-18 10:34:58,508 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:34:58,509 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:34:58,509 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:34:58,509 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:34:58,509 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:34:58,509 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:34:58,509 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:34:58,509 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:34:58,509 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:34:58,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-18 10:34:58,535 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 10:34:58,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:34:58,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:34:58,540 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 10:34:58,540 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:34:58,540 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:34:58,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-18 10:34:58,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 10:34:58,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:34:58,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:34:58,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 10:34:58,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:34:58,546 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, 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~nondet15;havoc main_#t~nondet15; 14#L539true assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.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~nondet17;havoc main_#t~nondet17; 25#L543true assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strlcat } true;strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 4#L521-6true [2018-11-18 10:34:58,547 INFO L796 eck$LassoCheckResult]: Loop: 4#L521-6true assume true; 10#L521-1true call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 11#L521-2true assume strlcat_#t~short7;strlcat_#t~post6 := strlcat_~n~0;strlcat_~n~0 := strlcat_#t~post6 - 1;strlcat_#t~short7 := 0 != strlcat_#t~post6 % 4294967296; 17#L521-4true assume !!strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6;havoc strlcat_#t~short7;strlcat_#t~post8.base, strlcat_#t~post8.offset := strlcat_~d~0.base, strlcat_~d~0.offset;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_#t~post8.base, 1 + strlcat_#t~post8.offset;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset; 4#L521-6true [2018-11-18 10:34:58,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:34:58,551 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-18 10:34:58,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:34:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:34:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:34:58,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:34:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:34:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:34:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:34:58,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:34:58,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1418155, now seen corresponding path program 1 times [2018-11-18 10:34:58,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:34:58,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:34:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:34:58,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:34:58,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:34:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:34:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:34:58,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:34:58,665 INFO L82 PathProgramCache]: Analyzing trace with hash 179533842, now seen corresponding path program 1 times [2018-11-18 10:34:58,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:34:58,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:34:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:34:58,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:34:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:34:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:34:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:34:58,822 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-11-18 10:34:59,072 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-18 10:34:59,161 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:34:59,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:34:59,162 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:34:59,162 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:34:59,162 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:34:59,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:34:59,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:34:59,163 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:34:59,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration1_Lasso [2018-11-18 10:34:59,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:34:59,163 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:34:59,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,414 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2018-11-18 10:34:59,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:34:59,798 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:34:59,801 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:34:59,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:34:59,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:34:59,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:34:59,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:34:59,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:34:59,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:34:59,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:34:59,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:34:59,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:34:59,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:34:59,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:34:59,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:34:59,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:34:59,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:34:59,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:34:59,904 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:34:59,926 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 10:34:59,926 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 10:34:59,928 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:34:59,929 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:34:59,930 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:34:59,930 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1) = -1*ULTIMATE.start_strlcat_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1 Supporting invariants [] [2018-11-18 10:34:59,970 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 10:34:59,975 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:34:59,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:00,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:00,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:00,071 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-18 10:35:00,072 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 5 states. [2018-11-18 10:35:00,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 5 states. Result 80 states and 108 transitions. Complement of second has 9 states. [2018-11-18 10:35:00,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:35:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:35:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-18 10:35:00,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-18 10:35:00,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:00,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-18 10:35:00,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:00,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-18 10:35:00,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:00,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 108 transitions. [2018-11-18 10:35:00,146 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:35:00,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 42 states and 51 transitions. [2018-11-18 10:35:00,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 10:35:00,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-18 10:35:00,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2018-11-18 10:35:00,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:00,150 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-18 10:35:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2018-11-18 10:35:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2018-11-18 10:35:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 10:35:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-18 10:35:00,168 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 10:35:00,168 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 10:35:00,168 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:35:00,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-11-18 10:35:00,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 10:35:00,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:00,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:00,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:35:00,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:00,170 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, 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~nondet15;havoc main_#t~nondet15; 225#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.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~nondet17;havoc main_#t~nondet17; 223#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strlcat } true;strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 212#L521-6 assume true; 214#L521-1 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 227#L521-2 assume !strlcat_#t~short7; 229#L521-4 assume !strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6;havoc strlcat_#t~short7; 221#L521-7 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 218#L525 assume !(0 == strlcat_~n~0 % 4294967296); 209#L527-4 [2018-11-18 10:35:00,170 INFO L796 eck$LassoCheckResult]: Loop: 209#L527-4 assume true; 204#L527-1 call strlcat_#t~mem10 := read~int(strlcat_~s~0.base, strlcat_~s~0.offset, 1); 205#L527-2 assume !!(0 != strlcat_#t~mem10);havoc strlcat_#t~mem10; 216#L528 assume !(1 != strlcat_~n~0 % 4294967296); 208#L528-2 strlcat_#t~post14.base, strlcat_#t~post14.offset := strlcat_~s~0.base, strlcat_~s~0.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_#t~post14.base, 1 + strlcat_#t~post14.offset;havoc strlcat_#t~post14.base, strlcat_#t~post14.offset; 209#L527-4 [2018-11-18 10:35:00,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:00,170 INFO L82 PathProgramCache]: Analyzing trace with hash 733389065, now seen corresponding path program 1 times [2018-11-18 10:35:00,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:00,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:00,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:00,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:00,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash 89771366, now seen corresponding path program 1 times [2018-11-18 10:35:00,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:00,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:00,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:00,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:00,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2058972834, now seen corresponding path program 1 times [2018-11-18 10:35:00,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:00,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:00,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:00,570 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2018-11-18 10:35:00,841 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2018-11-18 10:35:00,842 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:35:00,842 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:35:00,842 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:35:00,843 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:35:00,843 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:35:00,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:35:00,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:35:00,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:35:00,843 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration2_Lasso [2018-11-18 10:35:00,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:35:00,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:35:00,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:00,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,046 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2018-11-18 10:35:01,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:01,343 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2018-11-18 10:35:01,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:35:01,582 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:35:01,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:01,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:01,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:01,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:01,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,585 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:35:01,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,588 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:35:01,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:01,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:01,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:01,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:01,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:01,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:01,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:01,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:01,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:01,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:01,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:01,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:01,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:01,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:01,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:01,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:01,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:01,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:01,620 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:35:01,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,621 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:35:01,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:01,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,623 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:35:01,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,625 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:35:01,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:01,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:01,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:01,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:01,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:01,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:01,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:01,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:01,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:01,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:01,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:01,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:01,668 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:35:01,688 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:35:01,688 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:35:01,688 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:35:01,693 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:35:01,693 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:35:01,693 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2) = -1*ULTIMATE.start_strlcat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2 Supporting invariants [] [2018-11-18 10:35:01,744 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2018-11-18 10:35:01,746 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:35:01,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:01,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:01,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:01,797 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-18 10:35:01,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 10:35:01,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 39 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 41 states and 50 transitions. Complement of second has 7 states. [2018-11-18 10:35:01,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:35:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:35:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-18 10:35:01,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-18 10:35:01,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:01,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-18 10:35:01,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:01,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 10 letters. [2018-11-18 10:35:01,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:01,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2018-11-18 10:35:01,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:35:01,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 22 transitions. [2018-11-18 10:35:01,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 10:35:01,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 10:35:01,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2018-11-18 10:35:01,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:01,829 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 10:35:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2018-11-18 10:35:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 10:35:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 10:35:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-11-18 10:35:01,830 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 10:35:01,830 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 10:35:01,830 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:35:01,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-11-18 10:35:01,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:35:01,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:01,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:01,832 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:35:01,832 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:35:01,832 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 415#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, 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~nondet15;havoc main_#t~nondet15; 416#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.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~nondet17;havoc main_#t~nondet17; 414#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strlcat } true;strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 407#L521-6 assume true; 409#L521-1 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 418#L521-2 assume !strlcat_#t~short7; 420#L521-4 assume !strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6;havoc strlcat_#t~short7; 413#L521-7 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 411#L525 assume 0 == strlcat_~n~0 % 4294967296;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strlcat_~s~0.base, strlcat_~s~0.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 412#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 405#L509-4 [2018-11-18 10:35:01,832 INFO L796 eck$LassoCheckResult]: Loop: 405#L509-4 assume true;call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 406#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 422#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 405#L509-4 [2018-11-18 10:35:01,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1260223832, now seen corresponding path program 1 times [2018-11-18 10:35:01,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:01,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:01,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:01,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:01,853 INFO L82 PathProgramCache]: Analyzing trace with hash 74638, now seen corresponding path program 1 times [2018-11-18 10:35:01,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:01,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:01,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:01,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:01,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:01,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1019089623, now seen corresponding path program 1 times [2018-11-18 10:35:01,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:01,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:01,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:02,237 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 135 [2018-11-18 10:35:02,511 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2018-11-18 10:35:02,512 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:35:02,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:35:02,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:35:02,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:35:02,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:35:02,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:35:02,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:35:02,513 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:35:02,513 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration3_Lasso [2018-11-18 10:35:02,513 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:35:02,513 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:35:02,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,732 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-11-18 10:35:02,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:02,991 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-18 10:35:03,247 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:35:03,247 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:35:03,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:03,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:03,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:03,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:03,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:03,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:03,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:03,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:03,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:03,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:03,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:03,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:03,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:03,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:03,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:03,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:03,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-18 10:35:03,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:03,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:03,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:03,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:03,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:03,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:03,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:03,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:03,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:03,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:03,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:03,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:03,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:03,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:03,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:03,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:03,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:03,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:03,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:03,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:03,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:03,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:03,278 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:35:03,290 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:35:03,290 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:35:03,290 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:35:03,291 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:35:03,291 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:35:03,291 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_3, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_3 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2018-11-18 10:35:03,338 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 10:35:03,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:35:03,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:03,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:03,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:03,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 10:35:03,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-18 10:35:03,433 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 21 states and 26 transitions. Complement of second has 6 states. [2018-11-18 10:35:03,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 10:35:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:35:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-18 10:35:03,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 10:35:03,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:03,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-18 10:35:03,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:03,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-18 10:35:03,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:03,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-18 10:35:03,435 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:35:03,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2018-11-18 10:35:03,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:35:03,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:35:03,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:35:03,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:35:03,436 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:35:03,436 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:35:03,436 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:35:03,436 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:35:03,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:35:03,436 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:35:03,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:35:03,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:35:03 BoogieIcfgContainer [2018-11-18 10:35:03,441 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:35:03,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:35:03,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:35:03,442 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:35:03,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:34:58" (3/4) ... [2018-11-18 10:35:03,445 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:35:03,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:35:03,446 INFO L168 Benchmark]: Toolchain (without parser) took 5599.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -247.3 MB). Peak memory consumption was 82.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:35:03,447 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:35:03,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:35:03,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:35:03,448 INFO L168 Benchmark]: Boogie Preprocessor took 22.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:35:03,448 INFO L168 Benchmark]: RCFGBuilder took 227.95 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:35:03,448 INFO L168 Benchmark]: BuchiAutomizer took 4971.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.3 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. [2018-11-18 10:35:03,449 INFO L168 Benchmark]: Witness Printer took 3.58 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:35:03,451 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 227.95 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4971.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.3 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.58 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 6 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 56 SDtfs, 108 SDslu, 47 SDs, 0 SdLazy, 35 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf99 lsp95 ukn83 mio100 lsp45 div195 bol100 ite100 ukn100 eq162 hnf64 smp93 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...