./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/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_9b957911-8fd4-4a9c-9dfe-dbbf99393216/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/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-1dbac8b [2018-11-10 03:15:41,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:15:41,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:15:41,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:15:41,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:15:41,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:15:41,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:15:41,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:15:41,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:15:41,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:15:41,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:15:41,175 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:15:41,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:15:41,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:15:41,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:15:41,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:15:41,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:15:41,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:15:41,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:15:41,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:15:41,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:15:41,184 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:15:41,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:15:41,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:15:41,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:15:41,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:15:41,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:15:41,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:15:41,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:15:41,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:15:41,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:15:41,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:15:41,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:15:41,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:15:41,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:15:41,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:15:41,191 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 03:15:41,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:15:41,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:15:41,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:15:41,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:15:41,204 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:15:41,204 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:15:41,205 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:15:41,205 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:15:41,205 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:15:41,205 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:15:41,205 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:15:41,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:15:41,206 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:15:41,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:15:41,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:15:41,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:15:41,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:15:41,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:15:41,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:15:41,207 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:15:41,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:15:41,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:15:41,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:15:41,207 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:15:41,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:15:41,207 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:15:41,208 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:15:41,208 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:15:41,208 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_9b957911-8fd4-4a9c-9dfe-dbbf99393216/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-10 03:15:41,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:15:41,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:15:41,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:15:41,242 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:15:41,242 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:15:41,243 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i [2018-11-10 03:15:41,279 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/bin-2019/uautomizer/data/e06d81ed3/85ace211e4d14423bfe89d9c9ece41e5/FLAG7c4d2c7c3 [2018-11-10 03:15:41,652 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:15:41,652 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i [2018-11-10 03:15:41,661 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/bin-2019/uautomizer/data/e06d81ed3/85ace211e4d14423bfe89d9c9ece41e5/FLAG7c4d2c7c3 [2018-11-10 03:15:41,673 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/bin-2019/uautomizer/data/e06d81ed3/85ace211e4d14423bfe89d9c9ece41e5 [2018-11-10 03:15:41,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:15:41,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:15:41,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:15:41,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:15:41,680 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:15:41,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:41,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481efa52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41, skipping insertion in model container [2018-11-10 03:15:41,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:41,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:15:41,719 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:15:41,913 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:15:41,919 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:15:41,948 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:15:41,980 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:15:41,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41 WrapperNode [2018-11-10 03:15:41,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:15:41,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:15:41,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:15:41,981 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:15:41,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:42,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:42,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:15:42,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:15:42,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:15:42,052 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:15:42,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:42,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:42,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:42,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:42,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:42,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:42,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... [2018-11-10 03:15:42,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:15:42,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:15:42,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:15:42,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:15:42,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b957911-8fd4-4a9c-9dfe-dbbf99393216/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-10 03:15:42,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:15:42,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:15:42,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:15:42,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:15:42,327 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:15:42,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:15:42 BoogieIcfgContainer [2018-11-10 03:15:42,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:15:42,328 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:15:42,328 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:15:42,330 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:15:42,330 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:15:42,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:15:41" (1/3) ... [2018-11-10 03:15:42,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58e68b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:15:42, skipping insertion in model container [2018-11-10 03:15:42,331 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:15:42,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:41" (2/3) ... [2018-11-10 03:15:42,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58e68b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:15:42, skipping insertion in model container [2018-11-10 03:15:42,331 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:15:42,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:15:42" (3/3) ... [2018-11-10 03:15:42,333 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcat_true-termination.c.i [2018-11-10 03:15:42,369 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:15:42,370 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:15:42,370 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:15:42,370 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:15:42,370 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:15:42,370 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:15:42,370 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:15:42,370 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:15:42,370 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:15:42,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-10 03:15:42,394 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-10 03:15:42,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:15:42,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:15:42,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:15:42,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:15:42,398 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:15:42,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-10 03:15:42,399 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-10 03:15:42,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:15:42,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:15:42,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:15:42,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:15:42,405 INFO L793 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#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; 18#L539true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset; 12#L541true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L541 14#L541-1true main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 32#L543true assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset; 27#L545true SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L545 30#L545-1true 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; 6#L521-7true [2018-11-10 03:15:42,405 INFO L795 eck$LassoCheckResult]: Loop: 6#L521-7true assume true; 11#L521-1true SUMMARY for call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1); srcloc: L521-1 13#L521-2true strlcat_#t~short7 := strlcat_#t~mem5 != 0; 17#L521-3true assume strlcat_#t~short7;strlcat_#t~post6 := strlcat_~n~0;strlcat_~n~0 := strlcat_#t~post6 - 1;strlcat_#t~short7 := strlcat_#t~post6 % 4294967296 != 0; 3#L521-5true assume !!strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~short7;havoc strlcat_#t~post6;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, strlcat_#t~post8.offset + 1;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset; 6#L521-7true [2018-11-10 03:15:42,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:42,410 INFO L82 PathProgramCache]: Analyzing trace with hash 175627178, now seen corresponding path program 1 times [2018-11-10 03:15:42,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:15:42,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:15:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:42,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:15:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:42,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash 47777916, now seen corresponding path program 1 times [2018-11-10 03:15:42,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:15:42,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:15:42,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:42,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:15:42,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:42,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1066070413, now seen corresponding path program 1 times [2018-11-10 03:15:42,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:15:42,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:15:42,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:42,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:15:42,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:42,671 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-11-10 03:15:43,042 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2018-11-10 03:15:43,140 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:15:43,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:15:43,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:15:43,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:15:43,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:15:43,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:15:43,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:15:43,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:15:43,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration1_Lasso [2018-11-10 03:15:43,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:15:43,142 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:15:43,162 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-10 03:15:43,165 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-10 03:15:43,417 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2018-11-10 03:15:43,468 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-10 03:15:43,470 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-10 03:15:43,471 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-10 03:15:43,473 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-10 03:15:43,474 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-10 03:15:43,476 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-10 03:15:43,478 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-10 03:15:43,479 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-10 03:15:43,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:15:43,484 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-10 03:15:43,485 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-10 03:15:43,486 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-10 03:15:43,487 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-10 03:15:43,488 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-10 03:15:43,489 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-10 03:15:43,490 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-10 03:15:43,491 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-10 03:15:43,492 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-10 03:15:43,494 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-10 03:15:43,495 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-10 03:15:43,829 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:15:43,833 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:15:43,835 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-10 03:15:43,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:43,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:43,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:43,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:43,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:43,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:43,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:43,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:43,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:15:43,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:43,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:43,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:43,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:43,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:43,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:43,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:43,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-10 03:15:43,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:43,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:43,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:43,851 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:15:43,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:43,852 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:15:43,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:43,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:43,856 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-10 03:15:43,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:43,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:43,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:43,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:43,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:43,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:43,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:43,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-10 03:15:43,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:43,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:43,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:43,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:43,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:43,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:43,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:43,877 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-10 03:15:43,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:43,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:43,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:43,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:43,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:43,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:43,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:43,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:15:43,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:43,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:43,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:43,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:43,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:43,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:43,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:43,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:15:43,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:43,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:43,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:43,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:43,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:43,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:43,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:43,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:15:43,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:43,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:43,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:43,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:43,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:43,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:43,963 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:15:43,978 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:15:43,978 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:15:43,980 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:15:43,981 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:15:43,982 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:15:43,982 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~d~0.offset, v_rep(select #length ULTIMATE.start_strlcat_~d~0.base)_1) = -1*ULTIMATE.start_strlcat_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_strlcat_~d~0.base)_1 Supporting invariants [] [2018-11-10 03:15:44,015 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 03:15:44,023 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:15:44,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:15:44,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:15:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:15:44,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:15:44,114 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-10 03:15:44,129 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:15:44,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states. Second operand 4 states. [2018-11-10 03:15:44,205 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states.. Second operand 4 states. Result 104 states and 133 transitions. Complement of second has 7 states. [2018-11-10 03:15:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:15:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:15:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2018-11-10 03:15:44,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 03:15:44,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:15:44,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-10 03:15:44,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:15:44,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-10 03:15:44,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:15:44,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 133 transitions. [2018-11-10 03:15:44,212 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-10 03:15:44,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 47 states and 55 transitions. [2018-11-10 03:15:44,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 03:15:44,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-10 03:15:44,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2018-11-10 03:15:44,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:15:44,217 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-10 03:15:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2018-11-10 03:15:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-10 03:15:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 03:15:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-10 03:15:44,234 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-10 03:15:44,234 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-10 03:15:44,234 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:15:44,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 53 transitions. [2018-11-10 03:15:44,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-10 03:15:44,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:15:44,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:15:44,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:15:44,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:15:44,236 INFO L793 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#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; 257#L539 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset; 260#L541 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L541 261#L541-1 main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 264#L543 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset; 279#L545 SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L545 280#L545-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; 251#L521-7 assume true; 253#L521-1 SUMMARY for call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1); srcloc: L521-1 258#L521-2 strlcat_#t~short7 := strlcat_#t~mem5 != 0; 262#L521-3 assume !strlcat_#t~short7; 242#L521-5 assume !strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~short7;havoc strlcat_#t~post6; 243#L521-8 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 != 0 then (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 + 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 254#L525 assume !(strlcat_~n~0 % 4294967296 == 0); 278#L527-4 [2018-11-10 03:15:44,236 INFO L795 eck$LassoCheckResult]: Loop: 278#L527-4 assume true; 286#L527-1 SUMMARY for call strlcat_#t~mem10 := read~int(strlcat_~s~0.base, strlcat_~s~0.offset, 1); srcloc: L527-1 285#L527-2 assume !!(strlcat_#t~mem10 != 0);havoc strlcat_#t~mem10; 267#L528 assume !(strlcat_~n~0 % 4294967296 != 1); 268#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, strlcat_#t~post14.offset + 1;havoc strlcat_#t~post14.base, strlcat_#t~post14.offset; 278#L527-4 [2018-11-10 03:15:44,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:44,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2003575755, now seen corresponding path program 1 times [2018-11-10 03:15:44,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:15:44,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:15:44,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:44,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:15:44,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:44,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash 95497292, now seen corresponding path program 1 times [2018-11-10 03:15:44,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:15:44,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:15:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:44,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:15:44,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:44,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1679152834, now seen corresponding path program 1 times [2018-11-10 03:15:44,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:15:44,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:15:44,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:44,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:15:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:44,676 WARN L179 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2018-11-10 03:15:44,973 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2018-11-10 03:15:44,974 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:15:44,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:15:44,974 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:15:44,974 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:15:44,974 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:15:44,974 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:15:44,974 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:15:44,974 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:15:44,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration2_Lasso [2018-11-10 03:15:44,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:15:44,975 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:15:44,978 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-10 03:15:44,984 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-10 03:15:44,985 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-10 03:15:44,987 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-10 03:15:44,987 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-10 03:15:44,988 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-10 03:15:44,989 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-10 03:15:44,990 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-10 03:15:44,991 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-10 03:15:44,992 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-10 03:15:45,269 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2018-11-10 03:15:45,311 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-10 03:15:45,312 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-10 03:15:45,313 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-10 03:15:45,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:15:45,315 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-10 03:15:45,322 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-10 03:15:45,323 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-10 03:15:45,325 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-10 03:15:45,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:15:45,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:15:45,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:15:45,574 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-11-10 03:15:45,829 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:15:45,830 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:15:45,830 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-10 03:15:45,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:45,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:45,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:45,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,832 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-10 03:15:45,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:45,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:45,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:45,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,837 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-10 03:15:45,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:45,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:45,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,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-10 03:15:45,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:45,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:45,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:45,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,846 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-10 03:15:45,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:45,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:45,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:45,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,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-10 03:15:45,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:45,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:45,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:45,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,850 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-10 03:15:45,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:45,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:45,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:45,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,851 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-10 03:15:45,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:45,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:45,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:45,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:15:45,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:45,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:45,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:45,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,855 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-10 03:15:45,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:45,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:45,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,858 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-10 03:15:45,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:45,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:45,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,861 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-10 03:15:45,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:45,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:45,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,866 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-10 03:15:45,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,866 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:15:45,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,868 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:15:45,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:45,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,877 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-10 03:15:45,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:45,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:45,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:45,884 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-10 03:15:45,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:45,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:45,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:45,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:45,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:45,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:45,920 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:15:45,938 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 03:15:45,938 INFO L444 ModelExtractionUtils]: 62 out of 70 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 03:15:45,939 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:15:45,940 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:15:45,940 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:15:45,940 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_strlcat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 03:15:45,986 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-11-10 03:15:45,988 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:15:45,988 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:15:45,988 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 03:15:46,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:15:46,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:15:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:15:46,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:15:46,047 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-10 03:15:46,047 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-10 03:15:46,047 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 53 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-10 03:15:46,091 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 53 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 62 states and 73 transitions. Complement of second has 8 states. [2018-11-10 03:15:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:15:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:15:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-10 03:15:46,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 03:15:46,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:15:46,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 03:15:46,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:15:46,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 03:15:46,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:15:46,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-11-10 03:15:46,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 03:15:46,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 25 states and 29 transitions. [2018-11-10 03:15:46,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 03:15:46,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 03:15:46,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-11-10 03:15:46,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:15:46,096 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 03:15:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-11-10 03:15:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 03:15:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 03:15:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-10 03:15:46,101 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 03:15:46,101 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 03:15:46,101 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:15:46,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-10 03:15:46,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 03:15:46,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:15:46,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:15:46,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:15:46,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:15:46,102 INFO L793 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 506#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; 507#L539 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset; 511#L541 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L541 512#L541-1 main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 505#L543 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset; 503#L545 SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L545 504#L545-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; 500#L521-7 assume true; 502#L521-1 SUMMARY for call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1); srcloc: L521-1 509#L521-2 strlcat_#t~short7 := strlcat_#t~mem5 != 0; 513#L521-3 assume !strlcat_#t~short7; 491#L521-5 assume !strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~short7;havoc strlcat_#t~post6; 492#L521-8 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 != 0 then (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 + 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 498#L525 assume strlcat_~n~0 % 4294967296 == 0;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; 499#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 496#L509-5 [2018-11-10 03:15:46,102 INFO L795 eck$LassoCheckResult]: Loop: 496#L509-5 assume true; 497#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 515#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 495#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 496#L509-5 [2018-11-10 03:15:46,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:46,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1981305532, now seen corresponding path program 1 times [2018-11-10 03:15:46,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:15:46,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:15:46,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:46,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:15:46,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:46,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2463876, now seen corresponding path program 1 times [2018-11-10 03:15:46,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:15:46,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:15:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:46,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:15:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:46,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:46,127 INFO L82 PathProgramCache]: Analyzing trace with hash 940578239, now seen corresponding path program 1 times [2018-11-10 03:15:46,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:15:46,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:15:46,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:46,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:15:46,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:15:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:15:46,523 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 155 [2018-11-10 03:15:46,856 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 122 [2018-11-10 03:15:46,857 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:15:46,857 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:15:46,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:15:46,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:15:46,857 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:15:46,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:15:46,857 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:15:46,857 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:15:46,857 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration3_Lasso [2018-11-10 03:15:46,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:15:46,858 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:15:46,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:15:46,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:15:46,864 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-10 03:15:46,866 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-10 03:15:46,867 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-10 03:15:46,868 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-10 03:15:47,130 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 118 [2018-11-10 03:15:47,179 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-10 03:15:47,180 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-10 03:15:47,181 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-10 03:15:47,184 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-10 03:15:47,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-10 03:15:47,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:15:47,188 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-10 03:15:47,189 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-10 03:15:47,190 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-10 03:15:47,190 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-10 03:15:47,191 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-10 03:15:47,192 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-10 03:15:47,193 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-10 03:15:47,194 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-10 03:15:47,195 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-10 03:15:47,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-10 03:15:47,197 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-10 03:15:47,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-10 03:15:47,206 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-10 03:15:47,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:15:47,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-10 03:15:47,436 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2018-11-10 03:15:47,631 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-10 03:15:47,748 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:15:47,749 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:15:47,749 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-10 03:15:47,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:47,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:47,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:47,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:47,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:47,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:47,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:47,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:47,751 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-10 03:15:47,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:47,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:47,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:47,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:47,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:47,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:47,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:47,756 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-10 03:15:47,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:47,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:47,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:47,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:47,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:47,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:47,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:47,758 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-10 03:15:47,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:47,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:47,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:47,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:47,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:47,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:47,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:47,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:47,760 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-10 03:15:47,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:47,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:15:47,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:47,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:47,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:47,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:15:47,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:15:47,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:15:47,762 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-10 03:15:47,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:15:47,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:15:47,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:15:47,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:15:47,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:15:47,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:15:47,785 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:15:47,809 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 03:15:47,810 INFO L444 ModelExtractionUtils]: 75 out of 82 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 03:15:47,810 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:15:47,811 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:15:47,811 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:15:47,811 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2018-11-10 03:15:47,874 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 03:15:47,875 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:15:47,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:15:47,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 03:15:47,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:15:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:15:47,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:15:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:15:47,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:15:47,938 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-10 03:15:47,939 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:15:47,939 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 03:15:47,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 29 states and 34 transitions. Complement of second has 9 states. [2018-11-10 03:15:47,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:15:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:15:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-10 03:15:47,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-10 03:15:47,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:15:47,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-10 03:15:47,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:15:47,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-10 03:15:47,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:15:47,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-11-10 03:15:47,992 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:15:47,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. [2018-11-10 03:15:47,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:15:47,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:15:47,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:15:47,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:15:47,992 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:15:47,993 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:15:47,993 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:15:47,993 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:15:47,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:15:47,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:15:47,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:15:47,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:15:47 BoogieIcfgContainer [2018-11-10 03:15:47,998 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:15:47,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:15:47,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:15:47,999 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:15:47,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:15:42" (3/4) ... [2018-11-10 03:15:48,002 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:15:48,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:15:48,003 INFO L168 Benchmark]: Toolchain (without parser) took 6327.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 957.5 MB in the beginning and 1.4 GB in the end (delta: -406.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:15:48,004 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:15:48,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.14 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 930.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:15:48,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -245.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:15:48,005 INFO L168 Benchmark]: Boogie Preprocessor took 21.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-10 03:15:48,005 INFO L168 Benchmark]: RCFGBuilder took 254.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:15:48,005 INFO L168 Benchmark]: BuchiAutomizer took 5670.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -216.3 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:15:48,006 INFO L168 Benchmark]: Witness Printer took 3.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:15:48,008 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.14 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 930.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -245.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 254.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5670.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -216.3 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * 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[d] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 78 SDtfs, 148 SDslu, 67 SDs, 0 SdLazy, 52 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital234 mio100 ax100 hnf99 lsp96 ukn97 mio100 lsp43 div169 bol100 ite100 ukn100 eq163 hnf72 smp97 dnf100 smp100 tf100 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 6 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...